Examples of 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
co.nubetech.crux.server.filter.types.IntComparator
com.browseengine.bobo.util.IntBoundedPriorityQueue.IntComparator
eu.stratosphere.api.common.typeutils.base.IntComparator
org.apache.directory.mavibot.btree.comparator.IntComparator
Compares integers @author Apache Directory Project
org.apache.flink.api.common.typeutils.base.IntComparator
org.apache.hadoop.hbase.filter.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
org.broad.igv.util.IntComparator
@author jrobinso
r.builtins.Order.IntComparator
util.sort.IntComparator
Comparator to sort primitive integers (presumably indexes) @author Jean-Guillaume Fages @since 07/11/13

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

        k[a] = k[b];
        k[b] = t2;
      }
    };


    IntComparator comp = new IntComparator() {
      @Override
      public int compare(int a, int b) {
        int ab = ((Comparable)valueRef.get(a)).compareTo(valueRef.get(b));
        return ab < 0 ? -1 : ab > 0 ? 1 : (k[a] < k[b] ? -1 : (k[a] == k[b] ? 0 : 1));
      }

View Full Code Here

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

        k[a] = k[b];
        k[b] = t2;
      }
    };


    IntComparator comp = new IntComparator() {
      @Override
      public int compare(int a, int b) {
        return v[a] < v[b] ? -1 : v[a] > v[b] ? 1 : (k[a] < k[b] ? -1 : (k[a] == k[b] ? 0 : 1));
      }
    };

View Full Code Here

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

        k[a] = k[b];
        k[b] = t2;
      }
    };


    IntComparator comp = new IntComparator() {
      @Override
      public int compare(int a, int b) {
        return v[a] < v[b] ? -1 : v[a] > v[b] ? 1 : (k[a] < k[b] ? -1 : (k[a] == k[b] ? 0 : 1));
      }
    };

View Full Code Here

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

        k[a] = k[b];
        k[b] = t2;
      }
    };


    IntComparator comp = new IntComparator() {
      @Override
      public int compare(int a, int b) {
        return v[a] < v[b] ? -1 : v[a] > v[b] ? 1 : (k[a] < k[b] ? -1 : (k[a] == k[b] ? 0 : 1));
      }
    };

View Full Code Here

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

        k[a] = k[b];
        k[b] = t2;
      }
    };


    IntComparator comp = new IntComparator() {
      @Override
      public int compare(int a, int b) {
        return v[a] < v[b] ? -1 : v[a] > v[b] ? 1 : (k[a] < k[b] ? -1 : (k[a] == k[b] ? 0 : 1));
      }
    };

View Full Code Here

Examples of org.broad.igv.util.IntComparator

            int[] indices = new int[sz];
            for (int i = 0; i < indices.length; i++) {
                indices[i] = i;
            }


            (new ArrayHeapIntSorter()).sort(indices, new IntComparator() {


                public int compare(int arg0, int arg1) {
                    return starts.get(arg0) - starts.get(arg1);
                }
            });

View Full Code Here

Examples of r.builtins.Order.IntComparator

                }
            } else {
                order[oi++] = i;
            }
        }
        final IntComparator cmp = new IntComparator(x);
        Comparator<Integer> mainComparator = new Comparator<Integer>() {


            @Override public int compare(Integer o1, Integer o2) {
                int res = cmp.cmp(o1, o2);
                return !decreasing ? res : -res;
            }
        };
        Arrays.sort(order, 0, oi, mainComparator);
        return buildSortResults(x, order, oi, naorder, naLast, naRemoveIndex);

View Full Code Here

Examples of util.sort.IntComparator


  public SweepHeiSortCumulFilter(int n, Propagator cause){
    super(n,cause);
    sortedTasks = new int[n];
    taskSorter = new ArraySort(n,false,true);
    comparator = new IntComparator() {
      @Override
      public int compare(int i1, int i2) {
        return hlb[map[i2]]-hlb[map[i1]];
      }
    };

View Full Code Here

Examples of util.sort.IntComparator

    sorter = new ArraySort(n,false,true);
    slb = new int[n];
    dlb = new int[n];
    eub = new int[n];
    hlb = new int[n];
    comparator = new IntComparator(){
      @Override
      public int compare(int i1, int i2) {
        int coef1 = (100*dlb[i1]*hlb[i1])/(eub[i1]-slb[i1]);
        int coef2 = (100*dlb[i2]*hlb[i2])/(eub[i2]-slb[i2]);
        return coef2 - coef1;

View Full Code Here

0 1 2 3 4 5

TOP

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.