HomeSort by relevance Sort by last modified time
    Searched defs:binarySearch (Results 1 - 25 of 46) sorted by null

1 2

  /external/apache-harmony/annotation/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/
ElementTypeTest.java 63 assertTrue(Arrays.binarySearch(values, ElementType.METHOD) >= 0);
RetentionPolicyTest.java 58 assertTrue(Arrays.binarySearch(values, RetentionPolicy.RUNTIME) >= 0);
  /external/guava/src/com/google/common/collect/
NaturalOrdering.java 51 @Override public int binarySearch(
53 return Collections.binarySearch((List) sortedList, key);
ComparatorOrdering.java 43 @Override public int binarySearch(List<? extends T> sortedList, T key) {
44 return Collections.binarySearch(sortedList, key, comparator);
Ordering.java 383 * {@link Collections#binarySearch(List, Object, Comparator) Searches}
390 public int binarySearch(List<? extends T> sortedList, T key) {
391 return Collections.binarySearch(sortedList, key, this);
RegularImmutableSortedSet.java 88 return binarySearch(o) >= 0;
130 private int binarySearch(Object key) {
236 int index = binarySearch(element);
260 position = binarySearch(target);
ImmutableSortedMap.java 405 i = binarySearch(key);
412 private int binarySearch(Object key) {
655 int index = binarySearch(key);
  /libcore/luni/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/
ElementTypeTest.java 48 assertTrue(Arrays.binarySearch(values, ElementType.METHOD) >= 0);
RetentionPolicyTest.java 42 assertTrue(Arrays.binarySearch(values, RetentionPolicy.RUNTIME) >= 0);
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/compat/
ArraysCompatUtils.java 24 .getMethod(Arrays.class, "binarySearch", int[].class, int.class, int.class, int.class);
26 public static int binarySearch(int[] array, int startIndex, int endIndex, int value) {
43 final int index = Arrays.binarySearch(work, value);
  /external/webkit/Source/JavaScriptCore/wtf/
StdLibExtras.h 130 inline ArrayType* binarySearch(ArrayType* array, size_t size, KeyType key)
164 using WTF::binarySearch;
  /frameworks/base/core/java/android/util/
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) {
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) {
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) {
LongSparseArray.java 87 int i = binarySearch(mKeys, 0, mSize, key);
100 int i = binarySearch(mKeys, 0, mSize, key);
150 int i = binarySearch(mKeys, 0, mSize, key);
167 i = ~binarySearch(mKeys, 0, mSize, key);
257 return binarySearch(mKeys, 0, mSize, key);
329 private static int binarySearch(long[] a, int start, int len, long key) {
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/util/
SparseArray.java 63 int i = binarySearch(mKeys, 0, mSize, key);
76 int i = binarySearch(mKeys, 0, mSize, key);
126 int i = binarySearch(mKeys, 0, mSize, key);
143 i = ~binarySearch(mKeys, 0, mSize, key);
234 return binarySearch(mKeys, 0, mSize, key);
306 private static int binarySearch(int[] a, int start, int len, int key) {
SparseIntArray.java 59 int i = binarySearch(mKeys, 0, mSize, key);
72 int i = binarySearch(mKeys, 0, mSize, key);
94 int i = binarySearch(mKeys, 0, mSize, key);
159 return binarySearch(mKeys, 0, mSize, key);
215 private static int binarySearch(int[] a, int start, int len, int key) {
  /external/icu4c/i18n/
csrmbcs.cpp 93 static int32_t binarySearch(const uint16_t *array, int32_t len, uint16_t value)
167 if (binarySearch(commonChars, commonCharsLen, iter.charValue) >= 0){
  /external/libphonenumber/java/src/com/android/i18n/phonenumbers/geocoding/
AreaCodeMap.java 157 currentIndex = binarySearch(0, currentIndex, phonePrefix);
176 private int binarySearch(int start, int end, long value) {
  /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/app/
HCSparseArray.java 60 int i = binarySearch(mKeys, 0, mSize, key);
73 int i = binarySearch(mKeys, 0, mSize, key);
133 int i = binarySearch(mKeys, 0, mSize, key);
150 i = ~binarySearch(mKeys, 0, mSize, key);
240 return binarySearch(mKeys, 0, mSize, key);
312 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...]
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
Collections2Test.java 54 * @tests java.util.Collections#binarySearch(java.util.List,
62 int index = Collections.binarySearch(lst, new Integer(2), null);
67 * @tests java.util.Collections#binarySearch(java.util.List,
74 assertEquals(-1, Collections.binarySearch(localList, new Object()));
77 Collections.binarySearch(localList, new Integer(1));
  /frameworks/base/opengl/libs/EGL/
eglApi.cpp 93 int binarySearch(T const sortedArray[], int first, int last, T key) {
301 intptr_t index = binarySearch<egl_config_t>(
    [all...]
  /libcore/luni/src/test/java/libcore/java/util/
OldCollectionsTest.java 56 * java.util.Collections#binarySearch(java.util.List,
64 int index = Collections.binarySearch(lst, new Integer(2), null);
76 Collections.binarySearch(ll, new Integer(10), null);
84 * java.util.Collections#binarySearch(java.util.List,
91 assertEquals(-1, Collections.binarySearch(localList, new Object()));
94 Collections.binarySearch(localList, new Integer(1));
109 Collections.binarySearch(ll, new Integer(10));

Completed in 2251 milliseconds

1 2