Dalibor Topic wrote:
7 is the largest prime, that's still an iconst, iconst_7, afaik. That makes it take less bytecode.
Actually, iconst_5 is the maximum, but this seems like a little too low level view of the problem space ;-)
Thanks, I'll make it 5, then ;)
If two objects are not equal, they should have different hashCodes.
No this isn't true, however, if two objects are equal, they must have identical hashCodes. It would be nice if unequal objects had different hashCodes, but this is not a requirement.
Note that I used *should* in my sentence instead of *must*, and reparse what I said ;)
cheers, dalibor topic
_______________________________________________ Classpath mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/classpath
