Java中的Boolean的hashcode？

1231 and 1237 are just two (sufficiently large) arbitrary prime numbers. Any other two large prime numbers would do fine. When computing hash codes for composite objects it's common to add the hash codes for the components. If too small values are used in a hash set with a large number of buckets there's a risk of ending up with an uneven distribution of objects.

那为什么boolean只有true和false呢？

这种东西很玄学，当初我朋友面试就被问过，面试官也是无聊。就好比为什么HashMap中null默认hashCode为0，而Hashtable中却不这样做呢，可能只有去问JDK开发人员了 = =