public static int binarySearch(IntBuffer buff, int value) { return binarySearch(buff, 0, buff.limit(), value) ; }
public static int binarySearch(IntBuffer buff, int value) { return binarySearch(buff, 0, buff.limit(), value) ; }
public static int binarySearch(IntBuffer buff, int value) { return binarySearch(buff, 0, buff.limit(), value) ; }
private static void search(IntBuffer b, int k) { int idx1 = Alg.linearSearch(b, k) ; int idx2 = Alg.binarySearch(b, k) ; assertEquals(idx1, idx2) ; }
private static void search(IntBuffer b, int k, int low, int high) { int idx1 = Alg.linearSearch(b, low, high, k) ; int idx2 = Alg.binarySearch(b, low, high, k) ; assertEquals(idx1, idx2) ; } }
@Test public void binary7() { int[] data = {2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8} ; IntBuffer b = make(data) ; int idx = 0 ; idx = Alg.binarySearch(b, 4) ; assertEquals(4, data[idx]) ; idx = Alg.linearSearch(b, 8) ; assertEquals(8, data[idx]) ; search(b, 3) ; search(b, 5) ; search(b, 9) ; }