/
gvec.clj
484 lines (428 loc) · 19.3 KB
/
gvec.clj
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
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
; Copyright (c) Rich Hickey. All rights reserved.
; The use and distribution terms for this software are covered by the
; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
; which can be found in the file epl-v10.html at the root of this distribution.
; By using this software in any fashion, you are agreeing to be bound by
; the terms of this license.
; You must not remove this notice, or any other, from this software.
;;; a generic vector implementation for vectors of primitives
(in-ns 'clojure.core)
;(set! *warn-on-reflection* true)
(deftype VecNode [edit arr])
(def EMPTY-NODE (VecNode. nil (object-array 32)))
(definterface IVecImpl
(^int tailoff [])
(arrayFor [^int i])
(pushTail [^int level parent tailnode])
(popTail [^int level node])
(newPath [edit ^int level node])
(doAssoc [^int level node ^int i val]))
(definterface ArrayManager
(array [^int size])
(^int alength [arr])
(aclone [arr])
(aget [arr ^int i])
(aset [arr ^int i val]))
(deftype ArrayChunk [^clojure.core.ArrayManager am arr ^int off ^int end]
clojure.lang.Indexed
(nth [_ i] (.aget am arr (+ off i)))
(count [_] (- end off))
clojure.lang.IChunk
(dropFirst [_]
(if (= off end)
(throw (InvalidProgramException. "dropFirst of empty chunk")) ;;; IllegalStateException
(new ArrayChunk am arr (inc off) end)))
(reduce [_ f init]
(loop [ret init i off]
(if (< i end)
(recur (f ret (.aget am arr i)) (inc i))
ret)))
)
(deftype VecSeq [^clojure.core.ArrayManager am ^clojure.core.IVecImpl vec anode ^int i ^int offset]
:no-print true
; TODO: Figure out why compiling this causes an error when loading the assembly (bad type)
; clojure.core.protocols.InternalReduce
; (internal-reduce
; [_ f val]
; (loop [result val
; aidx offset]
; (if (< aidx (count vec))
; (let [node (.arrayFor vec aidx)
; result (loop [result result
; node-idx (bit-and (int 0x1f) aidx)]
; (if (< node-idx (.alength am node))
; (recur (f result (.aget am node node-idx)) (inc node-idx))
; result))]
; (recur result (bit-and (int 0xffe0) (+ aidx (int 32)))))
; result)))
clojure.lang.ISeq
(first [_] (.aget am anode offset))
(next [this]
(if (< (inc offset) (.alength am anode))
(new VecSeq am vec anode i (inc offset))
(.chunkedNext this)))
(more [this]
(let [s (.next this)]
(or s (clojure.lang.PersistentList/EMPTY))))
(^clojure.lang.ISeq cons [this ^Object o] ;;; type hint added due to cons overload of ISeq vs IPersistentCollection
(clojure.lang.Cons. o this))
(count [this]
(loop [i 1
s (next this)]
(if s
(if (instance? clojure.lang.Counted s)
(+ i (.count s))
(recur (inc i) (next s)))
i)))
(equiv [this o]
(cond
(identical? this o) true
(or (instance? clojure.lang.Sequential o) (instance? System.Collections.IEnumerable o)) ;;; java.util.List
(loop [me this
you (seq o)]
(if (nil? me)
(nil? you)
(and (clojure.lang.Util/equiv (first me) (first you))
(recur (next me) (next you)))))
:else false))
(empty [_]
clojure.lang.PersistentList/EMPTY)
clojure.lang.Seqable
(seq [this] this)
clojure.lang.IChunkedSeq
(chunkedFirst [_] (ArrayChunk. am anode offset (.alength am anode)))
(chunkedNext [_]
(let [nexti (+ i (.alength am anode))]
(when (< nexti (count vec))
(new VecSeq am vec (.arrayFor vec nexti) nexti 0))))
(chunkedMore [this]
(let [s (.chunkedNext this)]
(or s (clojure.lang.PersistentList/EMPTY)))))
(defmethod print-method ::VecSeq [v w]
((get (methods print-method) clojure.lang.ISeq) v w))
(deftype Vec [^clojure.core.ArrayManager am ^int cnt ^int shift root tail _meta]
Object
(Equals [this o] ;;; equals
(cond
(identical? this o) true
(or (instance? clojure.lang.IPersistentVector o) (instance? System.Collections.IList o)) ;;; java.util.RandomAccess -- no such thing, no real guarantee on IList. TODO: decide whether to keep
(and (= cnt (count o))
(loop [i (int 0)]
(cond
(= i cnt) true
(.Equals (.nth this i) (nth o i)) (recur (inc i)) ;;; .equals
:else false)))
(or (instance? clojure.lang.Sequential o) (instance? System.Collections.IList o)) ;;; java.util.List
(.Equals (seq this) (seq o)) ;;; .equals
:else false))
;todo - cache
(GetHashCode [this] ;;; hashCode
(loop [hash (int 1) i (int 0)]
(if (= i cnt)
hash
(let [val (.nth this i)]
(recur (unchecked-add (unchecked-multiply (int 31) hash)
(clojure.lang.Util/Hash val)) ;;; /hash
(inc i))))))
clojure.lang.Counted
(count [_] cnt)
clojure.lang.IMeta
(meta [_] _meta)
clojure.lang.IObj
(withMeta [_ m] (new Vec am cnt shift root tail m))
clojure.lang.Indexed
(nth [this i]
(let [a (.arrayFor this i)]
(.aget am a (bit-and i (int 0x1f)))))
(nth [this i not-found]
(let [z (int 0)]
(if (and (>= i z) (< i (.count this)))
(.nth this i)
not-found)))
clojure.lang.IPersistentCollection
(^clojure.lang.IPersistentCollection cons [this ^Object val] ;;; added type hints because we overload cons
(if (< (- cnt (.tailoff this)) (int 32))
(let [new-tail (.array am (inc (.alength am tail)))]
(Array/Copy tail new-tail (.alength am tail)) ;;; (System/arraycopy tail 0 new-tail 0 (.alength am tail))
(.aset am new-tail (.alength am tail) val)
(new Vec am (inc cnt) shift root new-tail (meta this)))
(let [tail-node (VecNode. (.edit root) tail)]
(if (> (bit-shift-right cnt (int 5)) (bit-shift-left (int 1) shift)) ;overflow root?
(let [new-root (VecNode. (.edit root) (object-array 32))]
(doto ^objects (.arr new-root)
(aset 0 root)
(aset 1 (.newPath this (.edit root) shift tail-node)))
(new Vec am (inc cnt) (+ shift (int 5)) new-root (let [tl (.array am 1)] (.aset am tl 0 val) tl) (meta this)))
(new Vec am (inc cnt) shift (.pushTail this shift root tail-node)
(let [tl (.array am 1)] (.aset am tl 0 val) tl) (meta this))))))
(empty [_] (new Vec am 0 5 EMPTY-NODE (.array am 0) nil))
(equiv [this o]
(cond
(or (instance? clojure.lang.IPersistentVector o) (instance? System.Collections.IList o)) ;;; java.util.RandomAccess- TODO: Decide if we should test for IList
(and (= cnt (count o))
(loop [i (int 0)]
(cond
(= i cnt) true
(= (.nth this i) (nth o i)) (recur (inc i))
:else false)))
(or (instance? clojure.lang.Sequential o) (instance? System.Collections.IEnumerable o)) ;;; java.util.List
(= (seq this) (seq o))
:else false))
clojure.lang.IPersistentStack
(peek [this]
(when (> cnt (int 0))
(.nth this (dec cnt))))
(pop [this]
(cond
(zero? cnt)
(throw (InvalidProgramException. "Can't pop empty vector")) ;;; IllegalStateException
(= 1 cnt)
(new Vec am 0 5 EMPTY-NODE (.array am 0) (meta this))
(> (- cnt (.tailoff this)) 1)
(let [new-tail (.array am (dec (.alength am tail)))]
(Array/Copy tail new-tail (.alength am new-tail)) ;;; (System/arraycopy tail 0 new-tail 0 (.alength am new-tail))
(new Vec am (dec cnt) shift root new-tail (meta this)))
:else
(let [new-tail (.arrayFor this (- cnt 2))
new-root (.popTail this shift root)]
(cond
(nil? new-root)
(new Vec am (dec cnt) shift EMPTY-NODE new-tail (meta this))
(and (> shift 5) (nil? (aget ^objects (.arr new-root) 1)))
(new Vec am (dec cnt) (- shift 5) (aget ^objects (.arr new-root) 0) new-tail (meta this))
:else
(new Vec am (dec cnt) shift new-root new-tail (meta this))))))
clojure.lang.IPersistentVector
(assocN [this i val]
(cond
(and (<= (int 0) i) (< i cnt))
(if (>= i (.tailoff this))
(let [new-tail (.array am (.alength am tail))]
(Array/Copy tail new-tail (.alength am tail)) ;;; (System/arraycopy tail 0 new-tail 0 (.alength am tail))
(.aset am new-tail (bit-and i (int 0x1f)) val)
(new Vec am cnt shift root new-tail (meta this)))
(new Vec am cnt shift (.doAssoc this shift root i val) tail (meta this)))
(= i cnt) (.cons this val)
:else (throw (IndexOutOfRangeException.)))) ;;; IndexOutOfBoundsException
clojure.lang.Reversible
(rseq [this]
(if (> (.count this) 0)
(clojure.lang.APersistentVector+RSeq. this (dec (.count this))) ;;; clojure.lang.APersistentVector$RSeq.
nil))
clojure.lang.Associative
(assoc [this k v]
(if (clojure.lang.Util/IsInteger k) ;;; isInteger
(.assocN this k v)
(throw (ArgumentException. "Key must be integer")))) ;;; IllegalArgumentException
(containsKey [this k]
(and (clojure.lang.Util/IsInteger k) ;;; isInteger
(<= 0 (int k))
(< (int k) cnt)))
(entryAt [this k]
(if (.containsKey this k)
(clojure.lang.MapEntry. k (.nth this (int k)))
nil))
clojure.lang.ILookup
(valAt [this k not-found]
(if (clojure.lang.Util/IsInteger k) ;;; isInteger
(let [i (int k)]
(if (and (>= i 0) (< i cnt))
(.nth this i)
not-found))
not-found))
(valAt [this k] (.valAt this k nil))
clojure.lang.IFn
(invoke [this k]
(if (clojure.lang.Util/IsInteger k) ;;; isInteger
(let [i (int k)]
(if (and (>= i 0) (< i cnt))
(.nth this i)
(throw (IndexOutOfRangeException.)))) ;;; IndexOutOfBoundsException
(throw (ArgumentException. "Key must be integer")))) ;;; IllegalArgumentException
clojure.lang.Seqable
(seq [this]
(if (zero? cnt)
nil
(VecSeq. am this (.arrayFor this 0) 0 0)))
clojure.lang.Sequential ;marker, no methods
clojure.core.IVecImpl
(tailoff [_]
(- cnt (.alength am tail)))
(arrayFor [this i]
(if (and (<= (int 0) i) (< i cnt))
(if (>= i (.tailoff this))
tail
(loop [node root level shift]
(if (zero? level)
(.arr node)
(recur (aget (.arr node) (bit-and (bit-shift-right i level) (int 0x1f))) ;;; Got rid of ^objects tag on (.arr node) TODO: Figure out why we don't compile properly with the tag.
(- level (int 5))))))
(throw (IndexOutOfRangeException.)))) ;;; IndexOutOfBoundsException
(pushTail [this level parent tailnode]
(let [subidx (bit-and (bit-shift-right (dec cnt) level) (int 0x1f))
ret (VecNode. (.edit parent) (aclone (.arr parent))) ;;; Got rid of ^objects tag on (.arr parent) TODO: Figure out why we don't compile properly with the tag.
node-to-insert (if (= level (int 5))
tailnode
(let [child (aget (.arr parent) subidx)] ;;; Got rid of ^objects tag on (.arr parent) TODO: Figure out why we don't compile properly with the tag.
(if child
(.pushTail this (- level (int 5)) child tailnode)
(.newPath this (.edit root) (- level (int 5)) tailnode))))]
(aset (.arr ret) subidx node-to-insert) ;;; Got rid of ^objects tag on (.arr ret) TODO: Figure out why we don't compile properly with the tag.
ret))
(popTail [this level node]
(let [subidx (bit-and (bit-shift-right (- cnt 2) level) (int 0x1f))]
(cond
(> level 5)
(let [new-child (.popTail this (- level 5) (aget ^objects (.arr node) subidx))]
(if (and (nil? new-child) (zero? subidx))
nil
(let [arr (aclone ^objects (.arr node))]
(aset arr subidx new-child)
(VecNode. (.edit root) arr))))
(zero? subidx) nil
:else (let [arr (aclone ^objects (.arr node))]
(aset arr subidx nil)
(VecNode. (.edit root) arr)))))
(newPath [this edit ^int level node]
(if (zero? level)
node
(let [ret (VecNode. edit (object-array 32))]
(aset ^objects (.arr ret) 0 (.newPath this edit (- level (int 5)) node))
ret)))
(doAssoc [this level node i val]
(if (zero? level)
;on this branch, array will need val type
(let [arr (.aclone am (.arr node))]
(.aset am arr (bit-and i (int 0x1f)) val)
(VecNode. (.edit node) arr))
(let [arr (aclone ^objects (.arr node))
subidx (bit-and (bit-shift-right i level) (int 0x1f))]
(aset arr subidx (.doAssoc this (- level (int 5)) (aget arr subidx) i val))
(VecNode. (.edit node) arr))))
System.IComparable ;;; java.lang.Comparable
(CompareTo [this o] ;;; compareTo
(if (identical? this o)
0
(let [#^clojure.lang.IPersistentVector v (cast clojure.lang.IPersistentVector o)
vcnt (.count v)]
(cond
(< cnt vcnt) -1
(> cnt vcnt) 1
:else
(loop [i (int 0)]
(if (= i cnt)
0
(let [comp (clojure.lang.Util/compare (.nth this i) (.nth v i))]
(if (= 0 comp)
(recur (inc i))
comp))))))))
System.Collections.IEnumerable ;;; java.lang.Iterable
(GetEnumerator [this] ;;; iterator
(let [i (clojure.lang.AtomicInteger. 0)] ;;; java.util.concurrent.atomic.AtomicInteger.
(reify System.Collections.IEnumerator ;;; java.util.Iterator
(MoveNext [_] (< (.incrementAndGet i) cnt)) ;;; (hasNext [_] (< (.get i) cnt))
(get_Current [_] (.nth this (.get i))) ;;; (next [_] (.nth this (dec (.incrementAndGet i))))
(Reset [_] (.set i 0))))) ;;; (remove [_] (throw (UnsupportedOperationException.))))))
;java.util.Collection
;(contains [this o] (boolean (some #(= % o) this)))
;(containsAll [this c] (every? #(.contains this %) c))
;(isEmpty [_] (zero? cnt))
;(toArray [this] (into-array Object this))
;(toArray [this arr]
; (if (>= (count arr) cnt)
; (do
; (dotimes [i cnt]
; (aset arr i (.nth this i)))
; arr)
; (into-array Object this)))
;(size [_] cnt)
;(add [_ o] (throw (UnsupportedOperationException.)))
;(addAll [_ c] (throw (UnsupportedOperationException.)))
;(clear [_] (throw (UnsupportedOperationException.)))
;(^boolean remove [_ o] (throw (UnsupportedOperationException.)))
;(removeAll [_ c] (throw (UnsupportedOperationException.)))
;(retainAll [_ c] (throw (UnsupportedOperationException.)))
System.Collections.ICollection
(CopyTo [this arr offset]
(dotimes [i cnt]
(aset arr (+ i offset) (.nth this i))))
(get_Count [_] cnt)
(get_IsSynchronized [_] true)
(get_SyncRoot [this] this)
;java.util.List
;(get [this i] (.nth this i))
;(indexOf [this o]
; (loop [i (int 0)]
; (cond
; (== i cnt) -1
; (= o (.nth this i)) i
; :else (recur (inc i)))))
;(lastIndexOf [this o]
; (loop [i (dec cnt)]
; (cond
; (< i 0) -1
; (= o (.nth this i)) i
; :else (recur (dec i)))))
;(listIterator [this] (.listIterator this 0))
;(listIterator [this i]
; (let [i (java.util.concurrent.atomic.AtomicInteger. i)]
; (reify java.util.ListIterator
; (hasNext [_] (< (.get i) cnt))
; (hasPrevious [_] (pos? i))
; (next [_] (.nth this (dec (.incrementAndGet i))))
; (nextIndex [_] (.get i))
; (previous [_] (.nth this (.decrementAndGet i)))
; (previousIndex [_] (dec (.get i)))
; (add [_ e] (throw (UnsupportedOperationException.)))
; (remove [_] (throw (UnsupportedOperationException.)))
; (set [_ e] (throw (UnsupportedOperationException.))))))
;(subList [this a z] (subvec this a z))
;(add [_ i o] (throw (UnsupportedOperationException.)))
;(addAll [_ i c] (throw (UnsupportedOperationException.)))
;(^Object remove [_ ^int i] (throw (UnsupportedOperationException.)))
;(set [_ i e] (throw (UnsupportedOperationException.)))
System.Collections.IList
(Add [_ v] (throw (InvalidOperationException.)))
(Clear [_] (throw (InvalidOperationException.)))
(Insert [_ i v] (throw (InvalidOperationException.)))
(Remove [_ v] (throw (InvalidOperationException.)))
(RemoveAt [_ i] (throw (InvalidOperationException.)))
(Contains [this o] (boolean (some #(= % o) this)))
(IndexOf [this o]
(loop [i (int 0)]
(cond
(== i cnt) -1
(= o (.nth this i)) i
:else (recur (inc i)))))
(get_IsFixedSize [_] true)
(get_Item [this i] (.nth this i))
(set_Item [_ i v] (throw (InvalidOperationException.))))
(defmethod print-method ::Vec [v w]
((get (methods print-method) clojure.lang.IPersistentVector) v w))
(defmacro mk-am {:private true} [t]
(let [garr (gensym)
tgarr (with-meta garr {:tag (symbol (str t "s"))})]
`(reify clojure.core.ArrayManager
(array [_ size#] (~(symbol (str t "-array")) size#))
(alength [_ ~garr] (alength ~tgarr))
(aclone [_ ~garr] (aclone ~tgarr))
(aget [_ ~garr i#] (aget ~tgarr i#))
(aset [_ ~garr i# val#] (aset ~tgarr i# (~t val#))))))
(def ^{:private true} ams
{:int (mk-am int)
:long (mk-am long)
:float (mk-am float)
:double (mk-am double)
:byte (mk-am byte)
:short (mk-am short)
:char (mk-am char)
:boolean (mk-am boolean)})
(defn vector-of
"Creates a new vector of a single primitive type t, where t is one
of :int :long :float :double :byte :short :char or :boolean. The
resulting vector complies with the interface of vectors in general,
but stores the values unboxed internally."
{:added "1.2"}
[t]
(let [am ^clojure.core.ArrayManager (ams t)]
(Vec. am 0 5 EMPTY-NODE (.array am 0) nil)))