/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
ArraysTest.java | 110 * @tests java.util.Arrays#binarySearch(byte[], byte) 113 // Test for method int java.util.Arrays.binarySearch(byte [], byte) 116 Arrays.binarySearch(byteArray, counter) == counter); 118 -1, Arrays.binarySearch(intArray, (byte) -1)); 121 Arrays.binarySearch(intArray, (byte) arraySize) == -(arraySize + 1)); 127 Arrays.binarySearch(byteArray, (byte) (counter - 50)) == counter); 131 * @tests java.util.Arrays#binarySearch(char[], char) 134 // Test for method int java.util.Arrays.binarySearch(char [], char) 138 Arrays.binarySearch(charArray, (char) (counter + 1)) == counter); 140 -1, Arrays.binarySearch(charArray, '\u0000')) [all...] |
Arrays2Test.java | 33 * @tests java.util.Arrays#binarySearch(double[], double) 42 int result = Arrays.binarySearch(specials, specials[i]); 47 -4, Arrays.binarySearch(specials, -1d)); 49 -8, Arrays.binarySearch(specials, 1d)); 53 * @tests java.util.Arrays#binarySearch(float[], float) 62 int result = Arrays.binarySearch(specials, specials[i]); 67 -4, Arrays.binarySearch(specials, -1f)); 69 -8, Arrays.binarySearch(specials, 1f)); 368 assertEquals(0, Arrays.binarySearch(strings, "a", 370 assertEquals(0, Arrays.binarySearch(strings, "A" [all...] |
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
SparseIntArray.java | 64 int i = binarySearch(mKeys, 0, mSize, key); 78 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 117 int i = binarySearch(mKeys, 0, mSize, key); 182 return binarySearch(mKeys, 0, mSize, key); 238 private static int binarySearch(int[] a, int start, int len, int key) {
|
SparseArray.java | 71 int i = binarySearch(mKeys, 0, mSize, key); 84 int i = binarySearch(mKeys, 0, mSize, key); 134 int i = binarySearch(mKeys, 0, mSize, key); 151 i = ~binarySearch(mKeys, 0, mSize, key); 241 return binarySearch(mKeys, 0, mSize, key); 335 private static int binarySearch(int[] a, int start, int len, int key) {
|
/frameworks/base/core/java/android/util/ |
LongSparseLongArray.java | 81 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 94 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 116 int i = Arrays.binarySearch(mKeys, 0, mSize, key); 170 return Arrays.binarySearch(mKeys, 0, mSize, key);
|
SparseBooleanArray.java | 74 int i = binarySearch(mKeys, 0, mSize, key); 87 int i = binarySearch(mKeys, 0, mSize, key); 102 int i = binarySearch(mKeys, 0, mSize, key); 167 return binarySearch(mKeys, 0, mSize, key); 223 private static int binarySearch(int[] a, int start, int len, int key) {
|
SparseIntArray.java | 78 int i = binarySearch(mKeys, 0, mSize, key); 91 int i = binarySearch(mKeys, 0, mSize, key); 113 int i = binarySearch(mKeys, 0, mSize, key); 178 return binarySearch(mKeys, 0, mSize, key); 234 private static int binarySearch(int[] a, int start, int len, int key) {
|
SparseLongArray.java | 78 int i = binarySearch(mKeys, 0, mSize, key); 91 int i = binarySearch(mKeys, 0, mSize, key); 113 int i = binarySearch(mKeys, 0, mSize, key); 167 return binarySearch(mKeys, 0, mSize, key); 226 private static int binarySearch(int[] a, int start, int len, long key) {
|
LongSparseArray.java | 82 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 156 int i = binarySearch(mKeys, 0, mSize, key); 173 i = ~binarySearch(mKeys, 0, mSize, key); 264 return binarySearch(mKeys, 0, mSize, key); 336 private static int binarySearch(long[] a, int start, int len, long key) {
|
SparseArray.java | 82 int i = binarySearch(mKeys, 0, mSize, key); 95 int i = binarySearch(mKeys, 0, mSize, key); 156 int i = binarySearch(mKeys, 0, mSize, key); 173 i = ~binarySearch(mKeys, 0, mSize, key); 264 return binarySearch(mKeys, 0, mSize, key); 336 private static int binarySearch(int[] a, int start, int len, int key) {
|
/external/guava/guava/src/com/google/common/collect/ |
ComparatorOrdering.java | 44 @Override public int binarySearch(List<? extends T> sortedList, T key) { 45 return Collections.binarySearch(sortedList, key, comparator);
|
NaturalOrdering.java | 49 @Override public int binarySearch( 51 return Collections.binarySearch((List) sortedList, key);
|
RegularImmutableSortedSet.java | 76 return binarySearch(o) >= 0; 128 private int binarySearch(Object key) { 129 // TODO(kevinb): split this into binarySearch(E) and 139 return Collections.binarySearch(elements, key, unsafeComparator); 203 index = SortedLists.binarySearch( 206 index = SortedLists.binarySearch( 223 index = SortedLists.binarySearch( 226 index = SortedLists.binarySearch( 258 position = SortedLists.binarySearch(elements, (E) target, comparator(),
|
SortedLists.java | 169 * {@link java.util.Collections#binarySearch(List, Object)} when the key isn't present, since 186 * <p>Equivalent to {@link #binarySearch(List, Function, Object, Comparator, KeyPresentBehavior, 189 public static <E extends Comparable> int binarySearch(List<? extends E> list, E e, 192 return binarySearch( 199 * <p>Equivalent to {@link #binarySearch(List, Function, Object, Comparator, KeyPresentBehavior, 202 public static <E, K extends Comparable> int binarySearch(List<E> list, 205 return binarySearch( 218 * {@link #binarySearch(List, Object, Comparator, KeyPresentBehavior, KeyAbsentBehavior)} using 221 public static <E, K> int binarySearch( 228 return binarySearch( [all...] |
RegularImmutableSortedMultiset.java | 144 int index = SortedLists.binarySearch( 157 index = SortedLists.binarySearch( 161 index = SortedLists.binarySearch( 175 index = SortedLists.binarySearch( 179 index = SortedLists.binarySearch(
|
/libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
Cache.java | 194 int idx = -1*Arrays.binarySearch(hashes_idx, prefix_hash)-1; 218 int idx = -1*Arrays.binarySearch(hashes_idx, hash)-1; 259 int idx = Arrays.binarySearch(hashes_idx, idx_hash); 267 int new_idx = Arrays.binarySearch(hashes_idx, new_hash_idx); 293 int idx = Arrays.binarySearch(hashes_idx, idx_hash);
|
/external/apache-harmony/annotation/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/ |
RetentionPolicyTest.java | 58 assertTrue(Arrays.binarySearch(values, RetentionPolicy.RUNTIME) >= 0);
|
/libcore/luni/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/ |
RetentionPolicyTest.java | 42 assertTrue(Arrays.binarySearch(values, RetentionPolicy.RUNTIME) >= 0);
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
ShadowSparseArray.java | 82 int i = binarySearch(mKeys, 0, mSize, key); 97 int i = binarySearch(mKeys, 0, mSize, key); 149 int i = binarySearch(mKeys, 0, mSize, key); 166 i = ~binarySearch(mKeys, 0, mSize, key); 262 return binarySearch(mKeys, 0, mSize, key); 337 private static int binarySearch(int[] a, int start, int len, int key) {
|
/frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
SparseWeakArray.java | 81 int i = binarySearch(mKeys, 0, mSize, key); 94 int i = binarySearch(mKeys, 0, mSize, key); 164 int i = binarySearch(mKeys, 0, mSize, key); 181 i = ~binarySearch(mKeys, 0, mSize, key); 271 return binarySearch(mKeys, 0, mSize, key); 353 private static int binarySearch(int[] a, int start, int len, int key) {
|
/frameworks/support/v4/java/android/support/v4/util/ |
LongSparseArray.java | 80 int i = binarySearch(mKeys, 0, mSize, key); 93 int i = binarySearch(mKeys, 0, mSize, key); 154 int i = binarySearch(mKeys, 0, mSize, key); 171 i = ~binarySearch(mKeys, 0, mSize, key); 262 return binarySearch(mKeys, 0, mSize, key); 334 private static int binarySearch(long[] a, int start, int len, long key) {
|
SparseArrayCompat.java | 60 int i = binarySearch(mKeys, 0, mSize, key); 73 int i = binarySearch(mKeys, 0, mSize, key); 146 int i = binarySearch(mKeys, 0, mSize, key); 163 i = ~binarySearch(mKeys, 0, mSize, key); 253 return binarySearch(mKeys, 0, mSize, key); 325 private static int binarySearch(int[] a, int start, int len, int key) {
|
/libcore/luni/src/main/java/java/util/ |
Arrays.java | 167 public static int binarySearch(byte[] array, byte value) { 168 return binarySearch(array, 0, array.length, value); 187 public static int binarySearch(byte[] array, int startIndex, int endIndex, byte value) { 217 public static int binarySearch(char[] array, char value) { 218 return binarySearch(array, 0, array.length, value); 237 public static int binarySearch(char[] array, int startIndex, int endIndex, char value) { 267 public static int binarySearch(double[] array, double value) { 268 return binarySearch(array, 0, array.length, value); 287 public static int binarySearch(double[] array, int startIndex, int endIndex, double value) { 328 public static int binarySearch(float[] array, float value) [all...] |
/frameworks/base/core/java/android/preference/ |
PreferenceGroupAdapter.java | 186 int insertPos = Collections.binarySearch(mPreferenceLayouts, pl); 217 if (Collections.binarySearch(mPreferenceLayouts, mTempPreferenceLayout) < 0) { 264 int viewType = Collections.binarySearch(mPreferenceLayouts, mTempPreferenceLayout);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
SortedListsTest.java | 102 SortedLists.binarySearch(LIST_WITHOUT_DUPS, key, presentBehavior, absentBehavior), 114 SortedLists.binarySearch(LIST_WITH_DUPS, key, presentBehavior, absentBehavior),
|