/frameworks/base/core/java/android/util/ |
ContainerHelpers.java | 21 // This is Arrays.binarySearch(), but doesn't do any argument validation. 22 static int binarySearch(int[] array, int size, int value) { 41 static int binarySearch(long[] array, int size, long value) {
|
LongSparseLongArray.java | 103 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 116 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 138 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 194 return ContainerHelpers.binarySearch(mKeys, mSize, key);
|
SparseIntArray.java | 101 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 114 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 136 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 192 return ContainerHelpers.binarySearch(mKeys, mSize, key);
|
SparseLongArray.java | 101 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 114 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 136 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 192 return ContainerHelpers.binarySearch(mKeys, mSize, key);
|
SparseBooleanArray.java | 98 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 111 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 133 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 194 return ContainerHelpers.binarySearch(mKeys, mSize, key);
|
LongSparseArray.java | 113 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 126 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 187 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 204 i = ~ContainerHelpers.binarySearch(mKeys, mSize, key); 286 return ContainerHelpers.binarySearch(mKeys, mSize, key);
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
ArraysTest.java | 105 * java.util.Arrays#binarySearch(byte[], byte) 108 // Test for method int java.util.Arrays.binarySearch(byte [], byte) 111 Arrays.binarySearch(byteArray, counter) == counter); 113 -1, Arrays.binarySearch(intArray, (byte) -1)); 116 Arrays.binarySearch(intArray, (byte) arraySize) == -(arraySize + 1)); 122 Arrays.binarySearch(byteArray, (byte) (counter - 50)) == counter); 126 * java.util.Arrays#binarySearch(char[], char) 129 // Test for method int java.util.Arrays.binarySearch(char [], char) 133 Arrays.binarySearch(charArray, (char) (counter + 1)) == counter); 135 -1, Arrays.binarySearch(charArray, '\u0000')) [all...] |
Arrays2Test.java | 33 * 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 * 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)); 369 assertEquals(0, Arrays.binarySearch(strings, "a", 371 assertEquals(0, Arrays.binarySearch(strings, "A" [all...] |
/external/smali/util/src/main/java/org/jf/util/ |
SparseIntArray.java | 71 int i = binarySearch(mKeys, 0, mSize, key); 85 int i = binarySearch(mKeys, 0, mSize, key); 102 int i = binarySearch(mKeys, 0, mSize, key); 124 int i = binarySearch(mKeys, 0, mSize, key); 189 return binarySearch(mKeys, 0, mSize, key); 245 private static int binarySearch(int[] a, int start, int len, int key) {
|
SparseArray.java | 78 int i = binarySearch(mKeys, 0, mSize, key); 91 int i = binarySearch(mKeys, 0, mSize, key); 141 int i = binarySearch(mKeys, 0, mSize, key); 158 i = ~binarySearch(mKeys, 0, mSize, key); 248 return binarySearch(mKeys, 0, mSize, key); 342 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(
|
/frameworks/support/v4/java/android/support/v4/util/ |
ContainerHelpers.java | 44 // This is Arrays.binarySearch(), but doesn't do any argument validation. 45 static int binarySearch(int[] array, int size, int value) { 64 static int binarySearch(long[] array, int size, long value) {
|
/packages/inputmethods/LatinIME/tools/dicttool/compat/android/util/ |
SparseArray.java | 45 final int index = Collections.binarySearch(mKeys, key); 60 final int index = Collections.binarySearch(mKeys, key);
|
/external/protobuf/java/src/main/java/com/google/protobuf/nano/ |
FieldArray.java | 72 int i = binarySearch(fieldNumber); 85 int i = binarySearch(fieldNumber); 122 int i = binarySearch(fieldNumber); 139 i = ~ binarySearch(fieldNumber); 237 private int binarySearch(int value) {
|
/packages/apps/UnifiedEmail/src/com/android/mail/utils/ |
SparseLongArray.java | 77 int i = binarySearch(mKeys, 0, mSize, key); 90 int i = binarySearch(mKeys, 0, mSize, key); 112 int i = binarySearch(mKeys, 0, mSize, key); 166 return binarySearch(mKeys, 0, mSize, key); 225 private static int binarySearch(int[] a, int start, int len, long key) {
|
/packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/settings/ |
SpacingAndPunctuations.java | 89 return Arrays.binarySearch(mSortedWordSeparators, code) >= 0; 93 return Arrays.binarySearch(mSortedWordConnectors, code) >= 0; 101 return Arrays.binarySearch(mSortedSymbolsPrecededBySpace, code) >= 0; 105 return Arrays.binarySearch(mSortedSymbolsFollowedBySpace, code) >= 0; 109 return Arrays.binarySearch(mSortedSymbolsClusteringTogether, code) >= 0;
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/ |
RetentionPolicyTest.java | 58 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); 152 int i = binarySearch(mKeys, 0, mSize, key); 169 i = ~binarySearch(mKeys, 0, mSize, key); 239 return binarySearch(mKeys, 0, mSize, key); 306 private static int binarySearch(long[] a, int start, int len, long key) {
|
/frameworks/support/v7/recyclerview/src/android/support/v7/widget/ |
PositionMap.java | 87 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 100 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 182 int i = ContainerHelpers.binarySearch(mKeys, mSize, key); 199 i = ~ContainerHelpers.binarySearch(mKeys, mSize, key); 290 return ContainerHelpers.binarySearch(mKeys, mSize, key); 439 // This is Arrays.binarySearch(), but doesn't do any argument validation. 440 static int binarySearch(int[] array, int size, int value) {
|
/libcore/luni/src/main/java/java/util/ |
Arrays.java | 168 public static int binarySearch(byte[] array, byte value) { 169 return binarySearch(array, 0, array.length, value); 188 public static int binarySearch(byte[] array, int startIndex, int endIndex, byte value) { 218 public static int binarySearch(char[] array, char value) { 219 return binarySearch(array, 0, array.length, value); 238 public static int binarySearch(char[] array, int startIndex, int endIndex, char value) { 268 public static int binarySearch(double[] array, double value) { 269 return binarySearch(array, 0, array.length, value); 288 public static int binarySearch(double[] array, int startIndex, int endIndex, double value) { 329 public static int binarySearch(float[] array, float value) [all...] |