You know realize hash of it? Why should this be achieved?
In the implementation in JDK 1.8, by hashCode () High Low 16-bit 16-bit XOR implemented: (h = k.hashCode ()) ^ (h >>> 16).
Mainly from the speed, efficiency and quality to consider, it can do so in the bucket of n relatively small, to ensure low bit computing hash are involved in, while bit computing will not have much overhead.
---------------------
Author: wipe Heart
Source: CSDN
Original: https: //blog.csdn.net/u011240877/article/details/53351188
Copyright: This article is a blogger original article, reproduced, please attach Bowen link!