i would love to know in a bit more detail how Clojure manages to allow arbitrary data structures as keys for its immutable hashmaps hashing an atomic value as a string or number is fast and i see how that would work when atomic values are used as keys but how about using a big nested vector as a key? wouldn't hashing it take an unacceptable amount of time? yet Clojure manages to do just that and i wonder how thank you for any bit of clarification Jay
-- 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.
