SplitSort.java

/*
 * Class:        SplitSort
 * Description:  Performs a split sort on arrays.
 * Environment:  Java
 * Software:     SSJ 
 * Copyright (C) 2001  Pierre L'Ecuyer and Universite de Montreal
 * Organization: DIRO, Universite de Montreal
 * @author       
 * @since
 
 * SSJ is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License (GPL) as published by the
 * Free Software Foundation, either version 3 of the License, or
 * any later version.
 
 * SSJ is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * A copy of the GNU General Public License is available at
   <a href="http://www.gnu.org/licenses">GPL licence site</a>.
 */
package umontreal.ssj.util.multidimsort;
 
import java.util.Arrays;

public class SplitSort<T extends MultiDimComparable<? super T>> implements MultiDimSortComparable<T> {
   private int dimension;

   public SplitSort(int d) {
      this.dimension = d;
   }
 
   public void sort(T[] a, int iMin, int iMax) {
      if (dimension == 1) {
         Arrays.sort(a, iMin, iMax, new MultiDimComparator<T>(0));
      } else {
         splitSort(a, iMin, iMax, 0);
      }
   }
 
   private void splitSort(T[] a, int iMin, int iMax, int splitCoord) {
      if (iMin == (iMax - 1))
         return;
      Arrays.sort(a, iMin, iMax, new MultiDimComparator<T>(splitCoord));
      int iMid = (iMin + iMax) / 2;
      splitSort(a, iMin, iMid, (splitCoord + 1) % dimension);
      splitSort(a, iMid, iMax, (splitCoord + 1) % dimension);
   }
 
   public void sort(T[] a) {
      sort(a, 0, a.length);
   }
 
   public void sort(double[][] a, int iMin, int iMax) {
      if (dimension == 1) {
         Arrays.sort(a, iMin, iMax, new DoubleArrayComparator(0));
      } else {
         splitSort(a, iMin, iMax, 0);
      }
   }
 
   private void splitSort(double[][] a, int iMin, int iMax, int splitCoord) {
      if (iMin == (iMax - 1))
         return;
      Arrays.sort(a, iMin, iMax, new DoubleArrayComparator(splitCoord));
      int iMid = (iMin + iMax) / 2;
      splitSort(a, iMin, iMid, (splitCoord + 1) % dimension);
      splitSort(a, iMid, iMax, (splitCoord + 1) % dimension);
   }
 
   public void sort(double[][] a) {
      sort(a, 0, a.length);
   }
 
   public int dimension() {
      return dimension;
   }
}