散列碼(hashcode)

最新推荐文章于 2024-03-31 15:50:47 发布

miss_yu

最新推荐文章于 2024-03-31 15:50:47 发布

阅读量1.1k

点赞数

分类专栏：概念C 文章标签： equals integer object bean each c

本文链接：https://blog.csdn.net/miss_yu/article/details/437473

版权

概念C 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

1.在散列(hashing)中,一個關鍵字的信息內容被用來確定唯一的一個值,稱位散列碼(hashcode)

2.1. Rule: If the equals() method returns true, then hashCode() for both the objects must return the same value. Note that the reverse is not required. So, it is ok if the equals() method returns false but the hashCode() returns same value for both the objects.

2.2. The hasCode() method does not satisfy the requirement:
If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result.
For example, equals() will return true for: new Info("aa", "b", "c") and new Info("a", "ab", "c") but their hashCode() values will be different.

2.3 So we must overiding equals() and hascode() in bean ,assure the two object is equals