Examples of org.apache.mahout.math.function.IntComparator

org.apache.mahout.math.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 org.apache.mahout.math.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.
@see java.util.Comparator @see org.apache.mahout.math.Sorting

      values.add(unknown + exc.getMessage());
    }




    // sort ascending by property name
    IntComparator comp = new IntComparator() {
      public int compare(int a, int b) {
        return Property.get(names, a).compareTo(Property.get(names, b));
      }
    };
    Swapper swapper = new Swapper() {

View Full Code Here

    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) {
        double av = vector.getQuick(a);
        double bv = vector.getQuick(b);
        if (av != av || bv != bv) {
          return compareNaN(av, bv);

View Full Code Here

    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

    for (int i = rows; --i >= 0;) {
      indexes[i] = i;
    }


    // compares two aggregates at a time
    IntComparator comp = new IntComparator() {
      public int compare(int x, int y) {
        double a = aggregates[x];
        double b = aggregates[y];
        if (a != a || b != b) {
          return compareNaN(a, b);

View Full Code Here

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


    final DoubleMatrix1D col = matrix.viewColumn(column);
    IntComparator comp = new IntComparator() {
      public int compare(int a, int b) {
        double av = col.getQuick(a);
        double bv = col.getQuick(b);
        if (av != av || bv != bv) {
          return compareNaN(av, bv);

View Full Code Here

    final DoubleMatrix1D[] views = new DoubleMatrix1D[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

    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);

View Full Code Here

    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

      }
    };


    // 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

  }
  
  @Test
  public void testQuickSortInts() {


    IntComparator revComp = new IntComparator() {
      
      @Override
      public int compare(int o1, int o2) {
        if (o2 < o1) {
          return -1;

View Full Code Here

0 1 2 3 4 5 6 7

TOP

Related Classes of org.apache.mahout.math.function.IntComparator

org.apache.mahout.math.map.AbstractByteByteMap

org.apache.mahout.math.map.AbstractByteCharMap

org.apache.mahout.math.map.AbstractByteDoubleMap

org.apache.mahout.math.map.AbstractByteFloatMap

org.apache.mahout.math.map.AbstractByteIntMap

org.apache.mahout.math.map.AbstractByteLongMap

org.apache.mahout.math.map.AbstractByteObjectMap

org.apache.mahout.math.map.AbstractByteShortMap

org.apache.mahout.math.map.AbstractCharByteMap

org.apache.mahout.math.map.AbstractCharCharMap

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.