001/*
002 *                    BioJava development code
003 *
004 * This code may be freely distributed and modified under the
005 * terms of the GNU Lesser General Public Licence.  This should
006 * be distributed with the code.  If you do not have a copy,
007 * see:
008 *
009 *      http://www.gnu.org/copyleft/lesser.html
010 *
011 * Copyright for this code is held jointly by the individual
012 * authors.  These should be listed in @author doc comments.
013 *
014 * For more information on the BioJava project and its aims,
015 * or to join the biojava-l mailing list, visit the home page
016 * at:
017 *
018 *      http://www.biojava.org/
019 *
020 */
021package org.biojava.bio.seq;
022
023import java.util.Comparator;
024
025import org.biojava.bio.symbol.Location;
026
027
028/**
029 * A Comparator similar to Feature.ByLocationComparator except that the min and max positions of
030 * the location are both compared
031 * 
032 *
033 * @author Mark Southern
034 * @since 1.5
035 */
036public class ByLocationMinMaxComparator implements Comparator {
037    private static Comparator comparator = new ByLocationMinMaxComparator();
038
039    public ByLocationMinMaxComparator() {
040    }
041
042    public static Comparator comparator() {
043        return comparator;
044    }
045
046    public int compare(Object o1, Object o2) {
047        Location loc1 = ( Location ) o1;
048        Location loc2 = ( Location ) o2;
049
050        Integer i1 = new Integer(loc1.getMin());
051        Integer i2 = new Integer(loc2.getMin());
052        int iComp = i1.compareTo(i2);
053
054        if (iComp != 0) {
055            return iComp;
056        }
057
058        i1 = new Integer(loc1.getMax());
059        i2 = new Integer(loc2.getMax());
060
061        return i1.compareTo(i2);
062    }
063}