import java.util.HashSet; 
  
public class MyClass 
{ 
     public String s; 
  
     public MyClass(String s) 
     { 
         this.s = s; 
     } 
  
     public int hashCode() 
     { 
         return s.hashCode(); 
     } 
  
     public boolean equals(Object obj) 
     { 
         if(obj == null) 
             return false; 
          
         if(!(obj instanceof MyClass)) 
             return false; 
          
         MyClass other = (MyClass)obj; 
         if(s == null) 
         { 
             return false; 
         } 
          
         return(s.equals(other.s)); 
     } 
  
     public static void main(String[] args) 
     { 
         HashSet<MyClass> set = new HashSet<MyClass>(); 
          
         MyClass mc1 = new MyClass("a");     
         set.add(mc1); 
  
         mc1.s = "b"; 
          
         MyClass mc2 = new MyClass("b"); 
          
         if(set.contains(mc2)) 
         { 
             System.out.println("True"); 
         } 
         else 
         { 
             System.out.println("False"); 
         } 
     } 
}

結果是False

我猜原因是：
在向set存儲時。位置是使用之前的哈希值得到的。
之後改變了mc1.s使得其哈希值發生了變化。

調用contains方法時，找的是之後哈希值指向的位置。這是盡管mc1和mc2有同樣的哈希值、且true == mc1.equeals(mc2)。但在該位置上根本沒有存儲東西，所以返回false

另外剛才找到Set的API文檔裏有這麽一段話
Note: Great care must be exercised if mutable objects are used as set elements. The behavior of a set is not specified if the value of an object is changed in a manner that affects equals comparisons while the object is an element in the set.

True or False? and WHY??? Java HashSet Contains