可比接口

时间:2014-02-28 10:01:07

标签: java interface comparable

为什么实施Comparable界面而不仅仅是定义我自己的compareTo()方法是有益的?

另一件事,java.util.Arrays.sort(Object[] o)方法如何与Comparable接口相关,以便我必须实现Comparable接口才能使用Arrays.sort(Object[] o)方法?

3 个答案:

答案 0 :(得分:2)

  

为什么实现Comparable接口而不是   只是定义我自己的compareTo方法?

您可以定义自己的方法,但需要比较的所有类必须知道它。为此目的,Java api中存在可比性,所有人都清楚这一点。可比较的接口是许多类的超类型,无论其来源如何。因此,它通常用于所有主要框架。

  

另一件事,java.util.Arrays.sort(Object [] o)方法如何   与Comparable接口有关,因此我必须实现   可比较的接口能够使用Arrays.sort(Object [] o)   方法

Arrays.sort()方法在内部调用compareTo()类的Comparable方法对内容进行排序。

检查Arrays.sort()的源代码,委派方法使用Comparabble#compareTo()方法

private static void mergeSort(Object[] src,
                  Object[] dest,
                  int low,
                  int high,
                  int off) {
    int length = high - low;

    // Insertion sort on smallest arrays
        if (length < INSERTIONSORT_THRESHOLD) {
            for (int i=low; i<high; i++)
                for (int j=i; j>low &&
             ((Comparable) dest[j-1]).compareTo(dest[j])>0; j--)
                    swap(dest, j, j-1);
            return;
        }

        // Recursively sort halves of dest into src
        int destLow  = low;
        int destHigh = high;
        low  += off;
        high += off;
        int mid = (low + high) >>> 1;
        mergeSort(dest, src, low, mid, -off);
        mergeSort(dest, src, mid, high, -off);

        // If list is already sorted, just copy from src to dest.  This is an
        // optimization that results in faster sorts for nearly ordered lists.
        if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {
            System.arraycopy(src, low, dest, destLow, length);
            return;
        }

        // Merge sorted halves (now in src) into dest
        for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
            if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
                dest[i] = src[p++];
            else
                dest[i] = src[q++];
        }
    }

答案 1 :(得分:2)

Comparable Interface允许您对列表和对象数组进行排序。如果要通过Collections.sort()方法对类的实例进行排序,则需要实现此接口。例如,您可以使用sort()方法轻松地对String实例进行排序,因为String Implements Comparable Interface和Interface有一个方法compareTo(),每次我们对String实例进行排序时都会调用它。类似地,您可以通过实现Comparable并覆盖其方法CompareTo()来以自己的方式使用它来对类的实例进行排序。

答案 2 :(得分:1)

// below is the example to override the CompareTo() method
import java.io.*;
import java.util.*;
public class DVDInfo implements Comparable<DVDInfo>{
    String title;
    String genre;
    String LeadActor;
    List<DVDInfo> dvdList=new ArrayList<DVDInfo>();

    public DVDInfo(String t, String g,String a) {
        title=t;
        genre=g;
        LeadActor=a;
    }
    public String toString()
    {
        return("Title: "+ title +" Genere: " +genre + " LeadActor: " +LeadActor );
    }
    public String getTitle()
    {
        return title;
    }
    public String getGenre()
    {
        return genre;
    }
    public String getLeadActor()
    {
        return LeadActor;
    }

    public void addList(DVDInfo d)
    {
        dvdList.add(d);

    }
    @SuppressWarnings("unchecked")
    public void populateList()
    {
            Collections.sort(dvdList);
            System.out.println(dvdList);

    }
    @Override
    public int compareTo(DVDInfo d) {
        // TODO Auto-generated method stub
        return title.compareTo(d.getTitle());
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub

        DVDInfo d=new DVDInfo("Conjuring","Horror","Patrik Wilson");
        DVDInfo e=new DVDInfo("Insidious", "Horror", "Patrik Wilson");

        d.addList(d);
                d.addList(e);
                d.populateList();

    }

    }


    enter code here