前言
大家都知道，equals和hashcode是java.lang.object類的兩個(gè)重要的方法，在實(shí)際應(yīng)用中常常需要重寫這兩個(gè)方法，但至于為什么重寫這兩個(gè)方法很多人都搞不明白。
在上一篇博文java中equals和==的區(qū)別中介紹了object類的equals方法，并且也介紹了我們可在重寫equals方法，本章我們來(lái)說一下為什么重寫equals方法的時(shí)候也要重寫hashcode方法。
先讓我們來(lái)看看object類源碼
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
|
/** * 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(); |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/** * 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ì)象的地址。
接下來(lái)我們看下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類來(lái)存儲(chǔ)數(shù)據(jù)時(shí)，都是根據(jù)存儲(chǔ)對(duì)象的hashcode值來(lái)進(jìn)行判斷是否相同的。如果我們將對(duì)象的equals方法重寫而不重寫hashcode，當(dāng)我們?cè)俅蝞ew一個(gè)新的對(duì)象的時(shí)候，equals方法返回的是true，但是hashcode方法返回的就不一樣了，如果需要將這些對(duì)象存儲(chǔ)到結(jié)合中（比如：set，map ...）的時(shí)候就違背了原有集合的原則，下面讓我們通過一段代碼看下。
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
/** * @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方法的都不重寫
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
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; }} |
|
1
2
3
4
5
6
|
p的hashcode:356573597p1的hashcode:1735600054falsefalsecom.blueskyli.練習(xí).person@677327b6com.blueskyli.練習(xí).person@1540e19d |
只重寫equals方法
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
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); }} |
|
1
2
3
4
5
6
|
p的hashcode:356573597p1的hashcode:1735600054truefalsecom.blueskyli.練習(xí).person@677327b6com.blueskyli.練習(xí).person@1540e19d |
equals和hashcode方法都重寫
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
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(); }} |
|
1
2
3
4
5
|
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ù)來(lái)規(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ì)服務(wù)器之家的支持。
原文鏈接：https://www.cnblogs.com/blueskyli/p/9936076.html
