More likely, records being just as slow with Clojure 1.9.0-alpha14 probably mean that recalculating of record hashes was not a significant amount of the time your program was taking. Thanks for trying it out.
Andy On Mon, Nov 21, 2016 at 5:03 PM, Didier <didi...@gmail.com> wrote: > I tried it with the safe equals, and it is slightly slower, but still > faster then all others at 4.5ms. The non safe equals gives me 4s. Though > this is now within my error margin. If ire-run quick-bench, I sometime get > a mean equal for each, so I don't think the instance check adds that much > overhead if any at all. > > @miner: Doesn't using the flag (set! *unchecked-math* :warn-on-boxed) > gives me unchecked math automatically? I was under the impression that +, > -, /, * etc. would all now perform in an equal way to unchecked-add, etc. > If not, what is the difference? > > @Andy: I tried with the "1.9.0-alpha14" version, and Records were still > just as slow as with "1.8.0". Maybe I'm using them wrong. > > On Tuesday, 15 November 2016 19:39:43 UTC-8, Didier wrote: > >> Hey all, >> >> I came upon a benchmark of F#, Rust and OCaml, where F# performs much >> faster then the other two. I decided for fun to try and port it to Clojure >> to see how Clojure does. Benchmark link: https://github.com/c-cube/hash >> set_benchs >> >> This is my code for it: https://gist.github.com/didibu >> s/1fd4c00b69d927745fbce3dcd7ca461a >> >> (ns hash-set-bench >> "A Benchmark I modified to Clojure from: >> https://github.com/c-cube/hashset_benchs";) >> >> (defn iterNeighbors [f [i j]] >> (f [(dec i) j]) >> (f [(inc i) j]) >> (f [i (dec j)]) >> (f [i (inc j)])) >> >> (defn nth* [n p] >> (loop [n n s1 #{p} s2 #{}] >> (if (= n 0) >> s1 >> (let [s0 (atom #{})] >> (letfn [(add [p] >> (when (not (or (contains? s1 p) (contains? s2 p))) >> (reset! s0 (conj @s0 p))))] >> (doseq [p s1] (iterNeighbors add p)) >> (recur (dec n) @s0 s1)))))) >> >> #_(printf "result is %d" (count (time (nth* 2000 [0 0])))) >> >> And here's the F# code: https://github.com/c-cube/hash >> set_benchs/blob/master/neighbors2.fsx >> >> Currently, this takes about 30s in Clojure, while it only takes around 3s >> for OCaml, Rust and F#. >> >> From what I see, the differences between my code and theirs are: >> >> - Lack of a Point struct, I'm just using a vector. >> - They use a mutable set, I don't. >> - They overrode Hashing for their point struct, as well as equality. >> I rely on Clojure's default hashing, and vector equality. >> >> I'm not sure if any of these things should really impact performance that >> much though. And what I could do in Clojure if I wanted to improve it. >> >> >> Any Help? >> >> >> Thanks. >> > -- > You received this message because you are subscribed to the Google > Groups "Clojure" group. > To post to this group, send email to clojure@googlegroups.com > Note that posts from new members are moderated - please be patient with > your first post. > To unsubscribe from this group, send email to > clojure+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/clojure?hl=en > --- > You received this message because you are subscribed to the Google Groups > "Clojure" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to clojure+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
