OneDimSort.java

/*
 * Class:        OneDimSort
 * Description:  Sorts the arrays according to one dimension
 * 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 OneDimSort<T extends MultiDimComparable<? super T>> implements MultiDimSortComparable<T> {
   private int j;
   private int d;

   public OneDimSort(int j, int d) {
      if (j < 0 || j >= d)
         throw new IllegalArgumentException("sortCoordinate from 0 to " + d + " - 1.");
      this.j = j;
      this.d = d;
   }

   public OneDimSort(int j) {
      this(j, j + 1);
      // this(d - 1, d);
   }
 
   public void sort(T[] a, int iMin, int iMax) {
      Arrays.sort(a, iMin, iMax, new MultiDimComparator<T>(j));
   }
 
   public void sort(T[] a) {
      sort(a, 0, a.length);
   }
 
   public void sort(double[][] a, int iMin, int iMax) {
      Arrays.sort(a, iMin, iMax, new DoubleArrayComparator(j));
   }
 
   public void sort(double[][] a) {
      sort(a, 0, a.length);
   }

   public int getSortCoordinate() {
      return j;
   }

   public int dimension() {
      return d;
   }

   public String toString() {
      return this.getClass().getSimpleName() + ": d = " + d + ", sort coordinate (starts at 0) = " + j;
   }
 
}