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 gnu.trove.list.TIntList.binarySearch()

        list = new TIntArrayList();
        list.add(5);


        assertEquals(-1, list.binarySearch(Integer.MIN_VALUE));
        assertEquals(-1, list.binarySearch(-1));
        assertEquals(-1, list.binarySearch(0));
        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));

View Full Code Here

Examples of gnu.trove.list.TIntList.binarySearch()

        list.add(5);


        assertEquals(-1, list.binarySearch(Integer.MIN_VALUE));
        assertEquals(-1, list.binarySearch(-1));
        assertEquals(-1, list.binarySearch(0));
        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));


        assertEquals(0, list.binarySearch(5));

View Full Code Here

Examples of gnu.trove.list.TIntList.binarySearch()


        assertEquals(-1, list.binarySearch(Integer.MIN_VALUE));
        assertEquals(-1, list.binarySearch(-1));
        assertEquals(-1, list.binarySearch(0));
        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));


        assertEquals(0, list.binarySearch(5));

View Full Code Here

Examples of gnu.trove.list.TIntList.binarySearch()

        assertEquals(-1, list.binarySearch(Integer.MIN_VALUE));
        assertEquals(-1, list.binarySearch(-1));
        assertEquals(-1, list.binarySearch(0));
        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));


        assertEquals(0, list.binarySearch(5));


        assertEquals(-2, list.binarySearch(6));

View Full Code Here

Examples of gnu.trove.list.TIntList.binarySearch()

        assertEquals(-1, list.binarySearch(-1));
        assertEquals(-1, list.binarySearch(0));
        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));


        assertEquals(0, list.binarySearch(5));


        assertEquals(-2, list.binarySearch(6));
    }

View Full Code Here

Examples of gnu.trove.list.TIntList.binarySearch()

        assertEquals(-1, list.binarySearch(1));
        assertEquals(-1, list.binarySearch(2));
        assertEquals(-1, list.binarySearch(3));
        assertEquals(-1, list.binarySearch(4));


        assertEquals(0, list.binarySearch(5));


        assertEquals(-2, list.binarySearch(6));
    }


    public void testListWrapExpand() {

View Full Code Here

Examples of gnu.trove.list.array.TIntArrayList.binarySearch()

            list2.add(graph.getNeighbor(v, d));
          }
          list2.sort();
          boolean contains = true;
          for (int x = 0; contains && x < list1.size(); x++) {
            if (list2.binarySearch(list1.get(x)) < 0) {
              contains = false;
            }
          }
          if (contains) {
            list.add(u);

View Full Code Here

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

    int j = column;


    int k = -1;
    IntArrayList indexList = indexes[i];
    if (indexList != null) {
      k = indexList.binarySearch(j);
    }


    if (k >= 0) { // found
      if (value == 0) {
        DoubleArrayList valueList = values[i];

View Full Code Here

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.