This one is quite good for me.
(defn countnl
[#^bytes buf]
(let [nl (int 10)]
(areduce buf idx count (int 0)
(if (== (int (aget buf idx)) nl)
(unchecked-inc count)
count))))
It appears that == is not resolved for bytes. So converting to int works fine.
In this situation, inlining (int 10) does not buy much.
This one, though, is even faster and should be not far from the java
one, if you want to try it.
(defn countnl
[#^bytes buf]
(let [nl (int 10)
n (int (alength buf))]
(loop [idx (int n) count (int 0)]
(if (zero? idx)
count
(let [idx (unchecked-dec idx)]
(if (== (int (aget buf idx)) nl)
(recur idx (unchecked-inc count))
(recur idx count)))))))
It would be interesting to know why it is nearly twice as fast as the
areduce version on my computer.
Best,
Nicolas.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to [email protected]
Note that posts from new members are moderated - please be patient with your
first post.
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/clojure?hl=en
