62,614
社区成员
发帖
与我相关
我的任务
分享
public static void main(String[] args){
Set aset = new TreeSet();
VO avo1 = new VO(1);
VO avo2 = new VO(3);
if(avo1.equals(avo2)){
System.out.println("equals:" + true);
}
if(avo1.hashCode() == avo2.hashCode()){
System.out.println("hashcode:" + true);
}
aset.add(avo1);
aset.add(avo2);
Iterator it = aset.iterator();
while(it.hasNext()){
VO show = (VO)it.next();
System.out.println(show.toString());
}
}
public class VO implements Comparable{
private int name;
public VO(int name){
this.name = name;
}
@Override
public boolean equals(Object obj) {
VO vo = (VO)obj;//比较余数
if(this.hashCode() - vo.hashCode()==0){
return true;
}
return false;
}
@Override
public int hashCode() {
// TODO Auto-generated method stub
return name%2;//取余数
}
@Override
public int compareTo(Object obj) {
return this.name - ((VO)obj).name;
}
@Override
public String toString() {
// TODO Auto-generated method stub
return "name:" + name;
}
}
public static void main(String[] args){
Set aset = new TreeSet();
VO avo1 = new VO(1);
VO avo2 = new VO(1);
aset.add(avo1);
aset.add(avo2);
Iterator it = aset.iterator();
while(it.hasNext()){
VO show = (VO)it.next();
System.out.println(show.toString());
}
}
public static void main(String[] args) {
TreeSet<Integer> tree = new TreeSet<Integer>();
tree.add(1);
tree.add(1);
for (Integer i : tree) {
System.out.println(i);
}
}