I'm not well versed enough in these data structures to know this without asking (apologies if it's really obvious to some people): is there opportunity to improve Clojure's built-in data structures with Bifurcan rather than trying to wrap Bifurcan's structures in Clojure?
As an aside, I want to draw people's attention to the sweet little criterium + gnuplot setup you have there for generating benchmarking plots. Nice! > On Mar 27, 2017, at 10:13 AM, Zach Tellman <[email protected] > <mailto:[email protected]>> wrote: > > Benchmarks are available here, and the Clojure benchmarks make use of > transients wherever possible: > https://github.com/lacuna/bifurcan/blob/master/doc/benchmarks.md > <https://github.com/lacuna/bifurcan/blob/master/doc/benchmarks.md>. > > More generally, while transients are often used in practice to quickly > construct a read-only data structure, the more formal definition is that they > provide an O(1) mechanism for transforming between immutable and mutable > forms. This isn't possible with purely mutable data structures like Java's > HashMap or Bifurcan's LinearMap. So while wrapping these data structures in > the Clojure API would provide better performance for construction and > lookups, it wouldn't be quite the same thing as a transient. > -- 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 --- 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 [email protected]. For more options, visit https://groups.google.com/d/optout.
