Hi,

In message "Re: key comparision inside Hash"
    on 02/03/15, Vladimir Dozen <Vladimir.Dozen / osw.com.ru> writes:

|   But why the procedure is so complex? Why not just use 'operator <=>'?
|   What I mean is that writing a good hash function may be not a simple
|   task, but most keys can be ordered by <=>.

Do you mean you're proposing binary search instead of hash algorithm
for Hash objects, if keys can be orderd by "<=>"?  I'm afraid it would
comprecate things even worse.

							matz.