> My guess is that it's your likelihood function that's actually broken. > If sr1 and sr2 don't come out with the same likelihood, then in some > cases of putting them into the sorted set they'll never end up > compared with each other for equality. (Actually, I'd have thought in > all cases. Perhaps the compareTo is separately broken and doesn't > total-order by likelihood?)
I thought this too, originally, but in my example above, all of the sr likelihoods are set to 1. I was under the assumption that when you tried to add to a set, it would check all of the members of that set before allowing its insertion. In the example above, sr2 is never even checked against sr1, the one SearchResult that is indeed equal to s2. Maybe I'm implementing (overriding, as the case may be) the wrong interfaces to get this working correctly. -Travis -- 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
