在学习TreeSet容器时需要重写想放入容器里的元素的CompareTo方法。
我先写了一个PersonDemo类,之后重写了compareTo方法。
package collection;
class PersonDemo implements Comparable{
private int age;
private String name;
public PersonDemo() {
super();
}
public PersonDemo(int age, String name) {
super();
this.age = age;
this.name = name;
}
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + age;
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;
PersonDemo other = (PersonDemo) obj;
if (age != other.age)
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
/*
* 我想用下面的方法来比较两个元素。
*/
@Override
public int compareTo(Object o) {
// TODO Auto-generated method stub
PersonDemo p = (PersonDemo) o;
// int temp = p.age-this.age;
// return temp==0?p.name.compareTo(this.name()):temp;
int temp1 = p.name.hashCode() + p.age * 39;
int temp2 = this.name.hashCode() + this.age * 39;
return temp1 - temp2;
}
}
之后我又在TreeSetDemo中使用了这个PersonDemo类。如下:
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetDemo {
public static void main(String[] args) {
// TODO Auto-generated method stub
TreeSet ts = new TreeSet();
ts.add(new PersonDemo(1,"王五"));
ts.add(new PersonDemo(3,"王1五"));
ts.add(new PersonDemo(3,"王0五"));
ts.add(new PersonDemo(5,"王2五"));
ts.add(new PersonDemo(7,"王3五"));
for(Iterator it = ts.iterator();it.hasNext();) {
PersonDemo p = new PersonDemo();
p = (PersonDemo)it.next();
System.out.println("name="+p.getName()+",age="+p.getAge());
}
}
}


669

被折叠的 条评论
为什么被折叠?



