On Wed, Oct 28, 2009 at 11:08 PM, John Harrop <jharrop...@gmail.com> wrote: > For the specific case of hashCode, no; identical values must have identical > hashes but different values need not have different hashes. Collisions due > to the hypothetical cutoff get exponentially less likely with each > additional increment of 1 of the cutoff length.
I see your point that hashCode could be made to work on infinite sequences, but since hashing is almost always a prelude to testing for equality, I'm hard pressed to think of an example of why you'd want to be able to do this. Can you illustrate with an example? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
