想要内存泄漏
内存还存在着对于程序来说没有用的对象 ! 这些对象是可达的(存在引用),即在有向图中,存在通路可以与其相连;其次,这些对象是无用的,即程序以后不会再使用这些对象。如果对象满足这两个条件,这些对象就可以判定为Java中的内存泄漏,这些对象不会被GC所回收,然而它却占用内存
例:
public class Person {
public String id;
public String name;
public Person(String id, String name) {
super();
this.id = id;
this.name = name;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((id == null) ? 0 : id.hashCode());
result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Person other = (Person) obj;
if (id == null) {
if (other.id != null)
return false;
} else if (!id.equals(other.id))
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
}
public class MemoryLeakPerson {
public static void main(String[] args) {
Collection<Person> list =new HashSet<Person>();
Person p1 = new Person("1","a");
Person p2 = new Person("2","b");
Person p3 = new Person("3","c");
Person p4 = new Person("4","d");
Person p5 = new Person("5","e");
Person p6 = new Person("6","f");
list.add(p1);
list.add(p2);
list.add(p3);
list.add(p4);
list.add(p5);
list.add(p6);
//1.要实现hashcode方法,因为更改后remove的时候,去根据hashcode寻找此对象的时候就找不到了.详情看源码
//2.这时候删除就会删除不掉,就会造成内存泄露,打印的还是6
p1.id="10";
p1.name="aaa";
list.remove(p1);
System.out.println(list.size());
}
}