Java equals 辦法與hashcode 辦法的深化解析

PS:本文運用jdk1.7
解析
1.Object類 的equals 辦法

   /**
     * 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);
    }

看代碼,Object的equals辦法,采用== 停止比擬,只是比擬對象的援用,假如援用的對象相反,那麼就前往true.
看正文,Object的equals辦法,具有如下特性
1.reflexive-自反性 
 x.equals(x)  return true
2.symmetric-對稱性
x.equals(y)  return true
y.equals(x)  return true
3.transitive-傳遞性
x.equals(y)  return true
y.equals(z)  return true
x.equals(z)  return true
4.consistent-分歧性
x.equals(y)  return true //那麼不論調用多少次,一定都是前往true
5.與null的比擬
x.equals(null) return false //關於none-null的x對象,每次必定前往false
6.於hashcode的關系
     * 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.
需求留意的是,普通來說,假如重寫了equals辦法,都必需要重寫hashcode辦法,
來確保具有相反援用的對象,可以具有異樣的hashcode值
好了,看到這裡,我們就明白了,為什麼重寫了equals辦法,普通來說就需求重寫hashcode辦法,
雖然這個不是強迫性的,但是假如不能保證相反的援用對象,沒有相反的hashcode,會對零碎留下很大隱患
2.String類的equals辦法

   /**
     * Compares this string to the specified object.  The result is {@code
     * true} if and only if the argument is not {@code null} and is a {@code
     * String} object that represents the same sequence of characters as this
     * object.
     *
     * @param  anObject
     *    The object to compare this {@code String} against
     *
     * @return  {@code true} if the given object represents a {@code String}
     *     equivalent to this string, {@code false} otherwise
     *
     * @see  #compareTo(String)
     * @see  #equalsIgnoreCase(String)
     */
    public boolean equals(Object anObject) {
   if (this == anObject) {
  return true;
   }
   if (anObject instanceof String) {
  String anotherString = (String) anObject;
  int n = value.length;
  if (n == anotherString.value.length) {
char v1[] = value;
char v2[] = anotherString.value;
int i = 0;
while (n-- != 0) {
     if (v1[i] != v2[i])
   return false;
     i++;
}
return true;
  }
   }
   return false;
    }

看源碼,我們可以發現,這個比擬分為兩局部
1.先比擬能否援用同一對象
2.假如援用對象不同,能否兩個String的content相反
3,String 類的hashcode 辦法

    /**
     * Returns a hash code for this string. The hash code for a
     * <code>String</code> object is computed as
     * <blockquote><pre>
     * s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
     * </pre></blockquote>
     * using <code>int</code> arithmetic, where <code>s[i]</code> is the
     * <i>i</i>th character of the string, <code>n</code> is the length of
     * the string, and <code>^</code> indicates exponentiation.
     * (The hash value of the empty string is zero.)
     *
     * @return  a hash code value for this object.
     */
    public int hashCode() {
   int h = hash;
   if (h == 0 && value.length > 0) {
  char val[] = value;
  for (int i = 0; i < value.length; i++) {
h = 31 * h + val[i];
  }
  hash = h;
   }
   return h;
    }

可以看到hashcode的計算公式為:s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]
因而,關於同一個String,得出的hashcode必定是分歧的
另外,關於空的字符串,hashcode的值是0

小結
至此,我們可以對本文掃尾的疑問做一個小結.
1.字符串比擬時用的什麼辦法,外部完成如何?
運用equals辦法,先比擬援用能否相反,後比擬內容能否分歧.

2.hashcode的作用,以及重寫equal辦法,為什麼要重寫hashcode辦法?
hashcode是零碎用來疾速檢索對象而運用,equals辦法是用來判別援用的對象能否分歧,所以,當援用對象分歧時,必需要確保其hashcode也分歧,因而需求重寫hashcode辦法來確保這個分歧性