net.anotheria.util.sorter.InsertSorter Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of ano-util Show documentation

There is a newer version: 4.0.0

package net.anotheria.util.sorter;

import java.util.ArrayList;
import java.util.List;

/**
 * A sorter implementation which works by the insert sort algorithm.
 *
 * @author another
 * @version $Id: $Id
 */
public class InsertSorter extends AbstractSorter {

	/** {@inheritDoc} */
	@Override
	public List sort(List toSort, SortType how){
      	ListEntry list = null;
		int method = how.getSortBy();
		for (T c : toSort){
			if (list==null){
       			list = new ListEntry<>(c);
          		continue;
         	}
          	ListEntry le = new ListEntry<>(c);
          	if (list.value.compareTo(le.value,method)>=0){
           		le.next = list;
             	list = le;
            }else{
            	list.insert(le, method);
            }



        }/*...while*/

        List v = new ArrayList<>(list.length());
        do{
        	v.add(list.value);
         	list = list.next;
        }while(list!=null);

      	return v;


 	}

  	private static class ListEntry {
  		/**
  		 * The value of the entry.
  		 */
  		private T value;

  	 	public ListEntry next;

  	  	public ListEntry(){
  	   		next = null;
  	     	value = null;
  	    }

  	    public ListEntry(T aValue){
  	    	this.value = aValue;
  	    }

  	    public int length(){
  	    	if (next==null)
  	     		return 1;
  	       	return 1+next.length();
  	    }

  		public void insert(ListEntry aNewEntry, int aMethod){
  	 		if (next == null){
  	   			next = aNewEntry;
  	      		return;
  	        }
  	        if (next.value.compareTo(aNewEntry.value, aMethod)>=0){
  	        	aNewEntry.next = next;
  	         	next = aNewEntry;
  	          	return;
  	        }
  	        next.insert(aNewEntry, aMethod);

  	  	}
  	}
}