java对象,要对其进行排序,有两个方法,本次介绍第一种,实现Comparable接口并重写compareTo方法。
Comparable接口中只有一个compareTo方法。要排序的对象的类要实现这个接口。
实现思路:
1. 要排序的对象实现Comparable接口;
2. 重写Comparable接口中的compareTo方法,指定排序规则;
3. 使用java.util.Arrays.sort(T o),对集合进行排序
compareTo方法中,比较对象和指定对象的关系:
比较对象大于指定对象返回一个正数,正常使用1;
比较对象小于指定对象返回一个负数,正常使用-1;
比较对象等于指定对象返回0。
看下Comparable的源码。
package java.lang;
import java.util.*;
/**
* This interface imposes a total ordering on the objects of each class that
* implements it. This ordering is referred to as the class's <i>natural
* ordering</i>, and the class's <tt>compareTo</tt> method is referred to as
* its <i>natural comparison method</i>.<p>
*
* Lists (and arrays) of objects that implement this interface can be sorted
* automatically by {@link Collections#sort(List) Collections.sort} (and
* {@link Arrays#sort(Object[]) Arrays.sort}). Objects that implement this
* interface can be used as keys in a {@linkplain SortedMap sorted map} or as
* elements in a {@linkplain SortedSet sorted set}, without the need to
* specify a {@linkplain Comparator comparator}.<p>
*
* The natural ordering for a class <tt>C</tt> is said to be <i>consistent
* with equals</i> if and only if <tt>e1.compareTo(e2) == 0</tt> has
* the same boolean value as <tt>e1.equals(e2)</tt> for every
* <tt>e1</tt> and <tt>e2</tt> of class <tt>C</tt>. Note that <tt>null</tt>
* is not an instance of any class, and <tt>e.compareTo(null)</tt> should
* throw a <tt>NullPointerException</tt> even though <tt>e.equals(null)</tt>
* returns <tt>false</tt>.<p>
*
* It is strongly recommended (though not required) that natural orderings be
* consistent with equals. This is so because sorted sets (and sorted maps)
* without explicit comparators behave "strangely" when they are used with
* elements (or keys) whose natural ordering is inconsistent with equals. In
* particular, such a sorted set (or sorted map) violates the general contract
* for set (or map), which is defined in terms of the <tt>equals</tt>
* method.<p>
*
* For example, if one adds two keys <tt>a</tt> and <tt>b</tt> such that
* <tt>(!a.equals(b) && a.compareTo(b) == 0)</tt> to a sorted
* set that does not use an explicit comparator, the second <tt>add</tt>
* operation returns false (and the size of the sorted set does not increase)
* because <tt>a</tt> and <tt>b</tt> are equivalent from the sorted set's
* perspective.<p>
*
* Virtually all Java core classes that implement <tt>Comparable</tt> have natural
* orderings that are consistent with equals. One exception is
* <tt>java.math.BigDecimal</tt>, whose natural ordering equates
* <tt>BigDecimal</tt> objects with equal values and different precisions
* (such as 4.0 and 4.00).<p>
*
* For the mathematically inclined, the <i>relation</i> that defines
* the natural ordering on a given class C is:<pre>
* {(x, y) such that x.compareTo(y) <= 0}.
* </pre> The <i>quotient</i> for this total order is: <pre>
* {(x, y) such that x.compareTo(y) == 0}.
* </pre>
*
* It follows immediately from the contract for <tt>compareTo</tt> that the
* quotient is an <i>equivalence relation</i> on <tt>C</tt>, and that the
* natural ordering is a <i>total order</i> on <tt>C</tt>. When we say that a
* class's natural ordering is <i>consistent with equals</i>, we mean that the
* quotient for the natural ordering is the equivalence relation defined by
* the class's {@link Object#equals(Object) equals(Object)} method:<pre>
* {(x, y) such that x.equals(y)}. </pre><p>
*
* This interface is a member of the
* <a href="{@docRoot}/../technotes/guides/collections/index.html">
* Java Collections Framework</a>.
*
* @param <T> the type of objects that this object may be compared to
*
* @author Josh Bloch
* @see java.util.Comparator
* @since 1.2
*/
public interface Comparable<T> {
/**
* Compares this object with the specified object for order. Returns a
* negative integer, zero, or a positive integer as this object is less
* than, equal to, or greater than the specified object.
*
* <p>The implementor must ensure <tt>sgn(x.compareTo(y)) ==
* -sgn(y.compareTo(x))</tt> for all <tt>x</tt> and <tt>y</tt>. (This
* implies that <tt>x.compareTo(y)</tt> must throw an exception iff
* <tt>y.compareTo(x)</tt> throws an exception.)
*
* <p>The implementor must also ensure that the relation is transitive:
* <tt>(x.compareTo(y)>0 && y.compareTo(z)>0)</tt> implies
* <tt>x.compareTo(z)>0</tt>.
*
* <p>Finally, the implementor must ensure that <tt>x.compareTo(y)==0</tt>
* implies that <tt>sgn(x.compareTo(z)) == sgn(y.compareTo(z))</tt>, for
* all <tt>z</tt>.
*
* <p>It is strongly recommended, but <i>not</i> strictly required that
* <tt>(x.compareTo(y)==0) == (x.equals(y))</tt>. Generally speaking, any
* class that implements the <tt>Comparable</tt> interface and violates
* this condition should clearly indicate this fact. The recommended
* language is "Note: this class has a natural ordering that is
* inconsistent with equals."
*
* <p>In the foregoing description, the notation
* <tt>sgn(</tt><i>expression</i><tt>)</tt> designates the mathematical
* <i>signum</i> function, which is defined to return one of <tt>-1</tt>,
* <tt>0</tt>, or <tt>1</tt> according to whether the value of
* <i>expression</i> is negative, zero or positive.
*
* @param o the object to be compared.
* @return a negative integer, zero, or a positive integer as this object
* is less than, equal to, or greater than the specified object.
*
* @throws NullPointerException if the specified object is null
* @throws ClassCastException if the specified object's type prevents it
* from being compared to this object.
*/
public int compareTo(T o);
}
示例:模拟一个员工对象,要对其进行排序,排序的条件是先根据薪水排序,当薪水相等的情况下载根据年龄进行排序,当年龄相等根据性别。降序方式。
首先写个员工类,让其实现Comparable接口,并重写compareTo方法,根据要求制定排序规则。
package cmc.com.jer.cmc;
public class Emp implements Comparable<Emp>{
protected String name;
protected int age;
protected Long sal;
/*排序顺序从高到低 根据sal age sex的优先顺序
* (non-Javadoc)
* @see java.lang.Comparable#compareTo(java.lang.Object)
*/
@Override
public int compareTo(Emp o) {
if(this.sal > o.getSal()){
return -1;
} else if(this.sal < o.getSal()){
return 1;
} else {
if(this.age > o.getAge()){
return -1;
} else if(this.age < o.getAge()){
return 1;
} else {
if(this.sex > o.getSex()){
return -1;
} else if(this.getSex() < o.getSex()){
return 1;
}
}
}
return 0;
}
protected int sex;//1 男 2 女
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;
}
public Long getSal() {
return sal;
}
public void setSal(Long sal) {
this.sal = sal;
}
public int getSex() {
return sex;
}
public void setSex(int sex) {
this.sex = sex;
}
public Emp() {
super();
}
public Emp(String name, int age, Long sal, int sex) {
super();
this.name = name;
this.age = age;
this.sal = sal;
this.sex = sex;
}
@Override
public String toString() {
return "Emp [name=" + name + ", age=" + age + ", sal=" + sal + ", sex="
+ sex + "]";
}
}
写个测试类。
package cmc.com.jer.cmc;
import java.util.Arrays;
public class Demo8 {
public static void main(String[] args) {
Emp zhou = new Emp("zhou", 25, 10000L,2);
Emp zhao = new Emp("zhao", 25, 10000L,1);
Emp qian = new Emp("qian", 27, 10007L,2);
Emp sun = new Emp("sun", 30, 10000L,1);
Emp li = new Emp("li", 10, 10900L,1);
Emp [] emps = {zhao,qian,zhou,sun,li};
Arrays.sort(emps);
for(Emp e : emps){
System.out.println(e);
}
}
}
运行的结果:
Emp [name=li, age=10, sal=10900, sex=1]
Emp [name=qian, age=27, sal=10007, sex=2]
Emp [name=sun, age=30, sal=10000, sex=1]
Emp [name=zhou, age=25, sal=10000, sex=2]
Emp [name=zhao, age=25, sal=10000, sex=1]
总结:
这种做法比使用冒泡之类的排序方法要方便,而且性能会高些。
下篇会介绍使用Comparator的方式。