List of binarySearch() Examples

Examples of binarySearch()

cern.colt.list.IntArrayList.binarySearch()
de.lmu.ifi.dbs.elki.database.ids.ArrayModifiableDBIDs.binarySearch()
gnu.trove.list.TIntList.binarySearch()
Performs a binary search for value in the entire list. Note that you must @{link #sort sort} the list before doing a search. @param value the value to search for @return the absolute offset in the list of the value, or itsnegative insertion point into the sorted list.
gnu.trove.list.array.TIntArrayList.binarySearch()
{@inheritDoc}
org.apache.mahout.math.list.IntArrayList.binarySearch()

Examples of org.apache.mahout.math.list.IntArrayList.binarySearch()

        double after = before - s;
        luColj.setQuick(i, after); // LUcolj is a copy
        lu.setQuick(i, j, after);   // this is the original
        if (sparse) {
          if (before == 0 && after != 0) { // nasty bug fixed!
            int pos = nonZeroIndexes.binarySearch(i);
            pos = -pos - 1;
            nonZeroIndexes.beforeInsert(pos, i);
          }
          if (before != 0 && after == 0) {
            nonZeroIndexes.remove(nonZeroIndexes.binarySearch(i));

View Full Code Here

Examples of org.apache.mahout.math.list.IntArrayList.binarySearch()

            int pos = nonZeroIndexes.binarySearch(i);
            pos = -pos - 1;
            nonZeroIndexes.beforeInsert(pos, i);
          }
          if (before != 0 && after == 0) {
            nonZeroIndexes.remove(nonZeroIndexes.binarySearch(i));
          }
        }
      }


      // Find pivot and exchange if necessary.

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.