国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁(yè) > 開發(fā) > Java > 正文

java中為何重寫equals時(shí)必須重寫hashCode方法詳解

2024-07-14 08:42:50
字體:
供稿:網(wǎng)友

前言

大家都知道,equals和hashcode是java.lang.Object類的兩個(gè)重要的方法,在實(shí)際應(yīng)用中常常需要重寫這兩個(gè)方法,但至于為什么重寫這兩個(gè)方法很多人都搞不明白。

在上一篇博文Java中equals和==的區(qū)別中介紹了Object類的equals方法,并且也介紹了我們可在重寫equals方法,本章我們來說一下為什么重寫equals方法的時(shí)候也要重寫hashCode方法。

 先讓我們來看看Object類源碼

/** * Returns a hash code value for the object. This method is * supported for the benefit of hash tables such as those provided by * {@link java.util.HashMap}. * <p> * The general contract of {@code hashCode} is: * <ul> * <li>Whenever it is invoked on the same object more than once during * an execution of a Java application, the {@code hashCode} method * must consistently return the same integer, provided no information * used in {@code equals} comparisons on the object is modified. * This integer need not remain consistent from one execution of an * application to another execution of the same application. * <li>If two objects are equal according to the {@code equals(Object)} * method, then calling the {@code hashCode} method on each of * the two objects must produce the same integer result. * <li>It is <em>not</em> required that if two objects are unequal * according to the {@link java.lang.Object#equals(java.lang.Object)} * method, then calling the {@code hashCode} method on each of the * two objects must produce distinct integer results. However, the * programmer should be aware that producing distinct integer results * for unequal objects may improve the performance of hash tables. * </ul> * <p> * As much as is reasonably practical, the hashCode method defined by * class {@code Object} does return distinct integers for distinct * objects. (This is typically implemented by converting the internal * address of the object into an integer, but this implementation * technique is not required by the * Java™ programming language.) * * @return a hash code value for this object. * @see java.lang.Object#equals(java.lang.Object) * @see java.lang.System#identityHashCode */ public native int hashCode();
/** * Indicates whether some other object is "equal to" this one. * <p> * The {@code equals} method implements an equivalence relation * on non-null object references: * <ul> * <li>It is <i>reflexive</i>: for any non-null reference value * {@code x}, {@code x.equals(x)} should return * {@code true}. * <li>It is <i>symmetric</i>: for any non-null reference values * {@code x} and {@code y}, {@code x.equals(y)} * should return {@code true} if and only if * {@code y.equals(x)} returns {@code true}. * <li>It is <i>transitive</i>: for any non-null reference values * {@code x}, {@code y}, and {@code z}, if * {@code x.equals(y)} returns {@code true} and * {@code y.equals(z)} returns {@code true}, then * {@code x.equals(z)} should return {@code true}. * <li>It is <i>consistent</i>: for any non-null reference values * {@code x} and {@code y}, multiple invocations of * {@code x.equals(y)} consistently return {@code true} * or consistently return {@code false}, provided no * information used in {@code equals} comparisons on the * objects is modified. * <li>For any non-null reference value {@code x}, * {@code x.equals(null)} should return {@code false}. * </ul> * <p> * The {@code equals} method for class {@code Object} implements * the most discriminating possible equivalence relation on objects; * that is, for any non-null reference values {@code x} and * {@code y}, this method returns {@code true} if and only * if {@code x} and {@code y} refer to the same object * ({@code x == y} has the value {@code true}). * <p> * Note that it is generally necessary to override the {@code hashCode} * method whenever this method is overridden, so as to maintain the * general contract for the {@code hashCode} method, which states * that equal objects must have equal hash codes. * * @param obj the reference object with which to compare. * @return {@code true} if this object is the same as the obj *  argument; {@code false} otherwise. * @see #hashCode() * @see java.util.HashMap */ public boolean equals(Object obj) { return (this == obj); }

hashCode:是一個(gè)native方法,返回的是對(duì)象的內(nèi)存地址,

equals:對(duì)于基本數(shù)據(jù)類型,==比較的是兩個(gè)變量的值。對(duì)于引用對(duì)象,==比較的是兩個(gè)對(duì)象的地址。

接下來我們看下hashCode的注釋

1.在 Java 應(yīng)用程序執(zhí)行期間,在對(duì)同一對(duì)象多次調(diào)用 hashCode 方法時(shí),必須一致地返回相同的整數(shù),前提是將對(duì)象進(jìn)行 equals 比較時(shí)所用的信息沒有被修改。
 從某一應(yīng)用程序的一次執(zhí)行到同一應(yīng)用程序的另一次執(zhí)行,該整數(shù)無(wú)需保持一致。 
2.如果根據(jù) equals(Object) 方法,兩個(gè)對(duì)象是相等的,那么對(duì)這兩個(gè)對(duì)象中的每個(gè)對(duì)象調(diào)用 hashCode 方法都必須生成相同的整數(shù)結(jié)果。 
3.如果根據(jù) equals(java.lang.Object) 方法,兩個(gè)對(duì)象不相等,那么兩個(gè)對(duì)象不一定必須產(chǎn)生不同的整數(shù)結(jié)果。
 但是,程序員應(yīng)該意識(shí)到,為不相等的對(duì)象生成不同整數(shù)結(jié)果可以提高哈希表的性能。

從hashCode的注釋中我們看到,hashCode方法在定義時(shí)做出了一些常規(guī)協(xié)定,即

1,當(dāng)obj1.equals(obj2) 為 true 時(shí),obj1.hashCode() == obj2.hashCode()

2,當(dāng)obj1.equals(obj2) 為 false 時(shí),obj1.hashCode() != obj2.hashCode()

hashcode是用于散列數(shù)據(jù)的快速存取,如利用HashSet/HashMap/Hashtable類來存儲(chǔ)數(shù)據(jù)時(shí),都是根據(jù)存儲(chǔ)對(duì)象的hashcode值來進(jìn)行判斷是否相同的。如果我們將對(duì)象的equals方法重寫而不重寫hashcode,當(dāng)我們?cè)俅蝞ew一個(gè)新的對(duì)象的時(shí)候,equals方法返回的是true,但是hashCode方法返回的就不一樣了,如果需要將這些對(duì)象存儲(chǔ)到結(jié)合中(比如:Set,Map ...)的時(shí)候就違背了原有集合的原則,下面讓我們通過一段代碼看下。

/** * @see Person * @param args */ public static void main(String[] args) { HashMap<Person, Integer> map = new HashMap<Person, Integer>(); Person p = new Person("jack",22,"男"); Person p1 = new Person("jack",22,"男"); System.out.println("p的hashCode:"+p.hashCode()); System.out.println("p1的hashCode:"+p1.hashCode()); System.out.println(p.equals(p1)); System.out.println(p == p1); map.put(p,888); map.put(p1,888); map.forEach((key,val)->{  System.out.println(key);  System.out.println(val); }); }

equals和hashCode方法的都不重寫

public class Person{ private String name; private int age; private String sex; Person(String name,int age,String sex){ this.name = name; this.age = age; this.sex = sex; }}
p的hashCode:356573597p1的hashCode:1735600054falsefalsecom.blueskyli.練習(xí).Person@677327b6com.blueskyli.練習(xí).Person@1540e19d

只重寫equals方法

public class Person{ private String name; private int age; private String sex; Person(String name,int age,String sex){ this.name = name; this.age = age; this.sex = sex; } @Override public boolean equals(Object obj) { if(obj instanceof Person){  Person person = (Person)obj;  return name.equals(person.name); } return super.equals(obj); }}
p的hashCode:356573597p1的hashCode:1735600054truefalsecom.blueskyli.練習(xí).Person@677327b6com.blueskyli.練習(xí).Person@1540e19d

equals和hashCode方法都重寫

public class Person{ private String name; private int age; private String sex; Person(String name,int age,String sex){ this.name = name; this.age = age; this.sex = sex; } @Override public boolean equals(Object obj) { if(obj instanceof Person){  Person person = (Person)obj;  return name.equals(person.name); } return super.equals(obj); } @Override public int hashCode() { return name.hashCode(); }}
p的hashCode:3254239p1的hashCode:3254239truefalsecom.blueskyli.練習(xí).Person@31a7df

我們知道m(xù)ap是不允許存在相同的key的,由上面的代碼可以知道,如果不重寫equals和hashCode方法的話會(huì)使得你在使用map的時(shí)候出現(xiàn)與預(yù)期不一樣的結(jié)果,具體equals和hashCode如何重寫,里面的邏輯如何實(shí)現(xiàn)需要根據(jù)現(xiàn)實(shí)當(dāng)中的業(yè)務(wù)來規(guī)定。

總結(jié):

1,兩個(gè)對(duì)象,用==比較比較的是地址,需采用equals方法(可根據(jù)需求重寫)比較。

2,重寫equals()方法就重寫hashCode()方法。

3,一般相等的對(duì)象都規(guī)定有相同的hashCode。

4,String類重寫了equals和hashCode方法,比較的是值。

5,重寫hashcode方法為了將數(shù)據(jù)存入HashSet/HashMap/Hashtable(可以參考源碼有助于理解)類時(shí)進(jìn)行比較

好了,以上就是這篇文章的全部?jī)?nèi)容了,希望本文的內(nèi)容對(duì)大家的學(xué)習(xí)或者工作具有一定的參考學(xué)習(xí)價(jià)值,如果有疑問大家可以留言交流,謝謝大家對(duì)VeVb武林網(wǎng)的支持。


注:相關(guān)教程知識(shí)閱讀請(qǐng)移步到JAVA教程頻道。
發(fā)表評(píng)論 共有條評(píng)論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 齐齐哈尔市| 隆化县| 年辖:市辖区| 吉水县| 天门市| 师宗县| 唐山市| 七台河市| 崇阳县| 富蕴县| 佛冈县| 彭山县| 滨州市| 墨玉县| 鹤岗市| 江津市| 芒康县| 肇东市| 庆云县| 钟祥市| 剑阁县| 姚安县| 莱芜市| 兖州市| 台南县| 呼和浩特市| 嘉鱼县| 茶陵县| 清苑县| 凤冈县| 怀柔区| 六枝特区| 芦溪县| 内江市| 怀来县| 三都| 论坛| 嘉兴市| 大丰市| 阿城市| 通渭县|