March 20, 2010
12:10 a.m.
Nick Coghlan wrote:
Mark Dickinson wrote:
It seems to me that given the existing conflation of numeric equivalence and containment testing, going the whole hog and fixing the set membership problem for all of our rational types would be the right thing to do.
Isn't this only solving half the problem, though? Even if you find that the hashes are equal, you still have to decide whether the values themselves are equal. Is there some similarly clever way of comparing two rational numbers without having explicit access to the numerators and denominators? -- Greg