Ok so,
This is what i got of running @Lein code example using hiphip 4 times in a
row,
performance is now acceptable add I'm happy about it
"Elapsed time: 9.096 msecs"
"Elapsed time: 1.707 msecs"
"Elapsed time: 1.493 msecs"
"Elapsed time: 0.839 msecs"
Turning :aot on didn't fix the first outlier
This is a lot messier than I thought it would be.
So far the fastest code is from @Michael_Gardner with the dotimes (~100ms)
Once I add :jvm-opts ^:replace [] on my profile and (set! *unchecked-math*
true) several examples drop to ~80ms
but @Leif example using hiphip drops to ~30ms.
@Leif I ca
Hey guys, here is a huge performance problem I'm trying to figure out:
;; Say you have 2 data arrays sitting out there of 1 MB
(def one-mb (byte-array (* 1024 1024)))
(def another-mb (byte-array (* 1024 1024)))
;; and another one that should have the byte-by-byte XOR of the previous
two
(de
