Examples of cern.colt.function.IntComparator

cern.colt.function.IntComparator
A comparison function which imposes a total ordering on some collection of elements. Comparators can be passed to a sort method (such as cern.colt.Sorting.quickSort) to allow precise control over the sort order.
Note: It is generally a good idea for comparators to implement java.io.Serializable, as they may be used as ordering methods in serializable data structures. In order for the data structure to serialize successfully, the comparator (if provided) must implement Serializable.
@author wolfgang.hoschek@cern.ch @version 0.1 01/09/99 @see java.util.Comparator @see cern.colt.Sorting


  int[] sliceIndexes = new int[matrix.slices()]; // indexes to reorder instead of matrix itself
  for (int i=sliceIndexes.length; --i >= 0; ) sliceIndexes[i] = i;


  final DoubleMatrix1D sliceView = matrix.viewRow(row).viewColumn(column);
  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      double av = sliceView.getQuick(a);
      double bv = sliceView.getQuick(b);
      if (av!=av || bv!=bv) return compareNaN(av,bv); // swap NaNs to the end
      return av<bv ? -1 : (av==bv ? 0 : 1);

View Full Code Here

  for (int i=sliceIndexes.length; --i >= 0; ) sliceIndexes[i] = i;


  final DoubleMatrix2D[] views = new DoubleMatrix2D[matrix.slices()]; // precompute views for speed
  for (int i=views.length; --i >= 0; ) views[i] = matrix.viewSlice(i);


  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      //return c.compare(matrix.viewSlice(a), matrix.viewSlice(b));
      return c.compare(views[a], views[b]);
    }
  };

View Full Code Here

*/
public ObjectMatrix1D sort(final ObjectMatrix1D vector) {
  int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
  for (int i=indexes.length; --i >= 0; ) indexes[i] = i;


  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (vector.getQuick(a));
      Comparable bv = (Comparable) (vector.getQuick(b));
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r>0 ? 1 : 0);

View Full Code Here

*/
public ObjectMatrix1D sort(final ObjectMatrix1D vector, final java.util.Comparator c) {
  int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
  for (int i=indexes.length; --i >= 0; ) indexes[i] = i;


  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      return c.compare(vector.getQuick(a), vector.getQuick(b));
    }
  };

View Full Code Here


  int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
  for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;


  final ObjectMatrix1D col = matrix.viewColumn(column);
  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (col.getQuick(a));
      Comparable bv = (Comparable) (col.getQuick(b));
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r>0 ? 1 : 0);

View Full Code Here

  for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;


  final ObjectMatrix1D[] views = new ObjectMatrix1D[matrix.rows()]; // precompute views for speed
  for (int i=views.length; --i >= 0; ) views[i] = matrix.viewRow(i);


  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      //return c.compare(matrix.viewRow(a), matrix.viewRow(b));
      return c.compare(views[a], views[b]);
    }
  };

View Full Code Here


  int[] sliceIndexes = new int[matrix.slices()]; // indexes to reorder instead of matrix itself
  for (int i=sliceIndexes.length; --i >= 0; ) sliceIndexes[i] = i;


  final ObjectMatrix1D sliceView = matrix.viewRow(row).viewColumn(column);
  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (sliceView.getQuick(a));
      Comparable bv = (Comparable) (sliceView.getQuick(b));
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r>0 ? 1 : 0);

View Full Code Here

  for (int i=sliceIndexes.length; --i >= 0; ) sliceIndexes[i] = i;


  final ObjectMatrix2D[] views = new ObjectMatrix2D[matrix.slices()]; // precompute views for speed
  for (int i=views.length; --i >= 0; ) views[i] = matrix.viewSlice(i);


  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      //return c.compare(matrix.viewSlice(a), matrix.viewSlice(b));
      return c.compare(views[a], views[b]);
    }
  };

View Full Code Here

    }
  };
  
  // compare splitter[a] with columnView[rowIndexes[b]]
  final ObjectMatrix1D columnView = matrix.viewColumn(column);
  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (splitters[a]);
      Comparable bv = (Comparable) (columnView.getQuick(g[b]));
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r==0 ? 0 : 1);
    }
  };


  // compare columnView[rowIndexes[a]] with columnView[rowIndexes[b]]
  IntComparator comp2 = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (columnView.getQuick(g[a]));
      Comparable bv = (Comparable) (columnView.getQuick(g[b]));
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r==0 ? 0 : 1);
    }
  };


  // compare splitter[a] with splitter[b]
  IntComparator comp3 = new IntComparator() {
    public int compare(int a, int b) {
      Comparable av = (Comparable) (splitters[a]);
      Comparable bv = (Comparable) (splitters[b]);
      int r = av.compareTo(bv);
      return r<0 ? -1 : (r==0 ? 0 : 1);

View Full Code Here

    }
  };
  
  // compare splitter[a] with columnView[rowIndexes[b]]
  final DoubleMatrix1D columnView = matrix.viewColumn(column);
  IntComparator comp = new IntComparator() {
    public int compare(int a, int b) {
      double av = splitters[a];
      double bv = columnView.getQuick(g[b]);
      return av<bv ? -1 : (av==bv ? 0 : 1);
    }
  };


  // compare columnView[rowIndexes[a]] with columnView[rowIndexes[b]]
  IntComparator comp2 = new IntComparator() {
    public int compare(int a, int b) {
      double av = columnView.getQuick(g[a]);
      double bv = columnView.getQuick(g[b]);
      return av<bv ? -1 : (av==bv ? 0 : 1);
    }
  };


  // compare splitter[a] with splitter[b]
  IntComparator comp3 = new IntComparator() {
    public int compare(int a, int b) {
      double av = splitters[a];
      double bv = splitters[b];
      return av<bv ? -1 : (av==bv ? 0 : 1);
    }

View Full Code Here

0 1 2 3

TOP

Related Classes of cern.colt.function.IntComparator

cern.colt.GenericSortingTest

cern.colt.matrix.doublealgo.Partitioning

cern.colt.matrix.doublealgo.Sorting

cern.colt.matrix.objectalgo.Partitioning

cern.colt.matrix.objectalgo.Sorting

statechum.analysis.learning.linear.TestLinear

statechum.analysis.learning.rpnicore.Linear

statechum.analysis.learning.rpnicore.TestLinear

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.