thank you very much for the clarification so no magic there :-) using big nested structures as keys is gonna slow down things a bit
but how caching can help? On Friday, November 10, 2017 at 12:29:41 PM UTC+7, tbc++ wrote: > > Most Clojure collections cache their hashcode, so that improves things > quite bit. Also, very large collections are rarely used as *keys* in other > maps. Most of the time key collections are one or two values. This means > that what we're really talking about is combining the hash values of a few > values, and that's pretty fast. > > So sure, the initial hash of one million symbols inside a vector may take > a fair amount of time, but I've never seen that in the wild. > > Timothy > > > -- 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.
