TreeSet自然顺序(Comparable)
1、示例代码如下:
测试类:
package com.jh.www;
import java.util.TreeSet;
public class Test6 {
public static void main(String[] args) {
// demo1();
TreeSet<Student> ts = new TreeSet<>();
ts.add(new Student("张三",18));
ts.add(new Student("张三",18));
ts.add(new Student("王五",20));
ts.add(new Student("李四",20));
ts.add(new Student("李四",20));
System.out.println(ts);
}
private static void demo1() {
TreeSet<String> ts = new TreeSet<>();
ts.add("ccc");
ts.add("aaa");
ts.add("bbb");
ts.add("aaa");
System.out.println(ts);
}
}
学生类:
package com.jh.www;
public class Student implements Comparable {
private String name;
private int age;
public Student() {
super();
// TODO Auto-generated constructor stub
}
public Student(String name, int age) {
super();
this.name = name;
this.age = age;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
@Override
public String toString() {
return "Student [name=" + name + ", age=" + age + "]";
}
@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;
Student other = (Student) 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;
}
@Override
public int compareTo(Object o) {
/*正数:添加所有的元素,并且元素往右放;
*零:只添加一个元素,后面的都不放;
*负数:添加所有的元素,并且所有元素往左放;
* **/
Student stu = (Student) o;
int num = this.name.compareTo(stu.getName());//优先姓名进行比较;
return num == 0 ? this.age-stu.getAge() :num;//其次以年龄进行排序
}
}