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

1 2 3 4 5 6 7 8 91011>>

  /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) {
IntArray.java 129 public int binarySearch(int value) {
130 return ContainerHelpers.binarySearch(mValues, mSize, value);
  /frameworks/support/collection/src/main/java/androidx/collection/
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) {
  /libcore/harmony-tests/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/guava/src/com/google/common/collect/
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...]
Ordering.java     [all...]
  /art/test/137-cfi/src/
Main.java 174 // Call bar via Arrays.binarySearch.
177 Arrays.binarySearch(array, 0, 3, this /* value */, this /* comparator */);
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
ICUBinary.java 97 int index = binarySearch(bytes, key);
110 int index = binarySearch(bytes, folder);
123 private static int binarySearch(ByteBuffer bytes, CharSequence key) {
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
ICUBinary.java 93 int index = binarySearch(bytes, key);
106 int index = binarySearch(bytes, folder);
119 private static int binarySearch(ByteBuffer bytes, CharSequence key) {
  /external/protobuf/javanano/src/main/java/com/google/protobuf/nano/
FieldArray.java 75 int i = binarySearch(fieldNumber);
88 int i = binarySearch(fieldNumber);
125 int i = binarySearch(fieldNumber);
142 i = ~ binarySearch(fieldNumber);
240 private int binarySearch(int value) {
  /external/smali/util/src/main/java/org/jf/util/
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) {
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) {
  /frameworks/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) {
  /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) {
  /external/icu/icu4c/source/i18n/
csrmbcs.cpp 95 static int32_t binarySearch(const uint16_t *array, int32_t len, uint16_t value)
169 if (binarySearch(commonChars, commonCharsLen, iter.charValue) >= 0){
collationfastlatinbuilder.cpp 59 * Like Java Collections.binarySearch(List, String, Comparator).
65 binarySearch(const int64_t list[], int32_t limit, int64_t ce) {
415 int32_t i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
424 int32_t index = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
  /external/libphonenumber/internal/prefixmapper/src/com/google/i18n/phonenumbers/prefixmapper/
PhonePrefixMap.java 161 currentIndex = binarySearch(0, currentIndex, phonePrefix);
192 private int binarySearch(int start, int end, long value) {
  /external/robolectric/v1/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/opt/setupwizard/library/main/src/com/android/setupwizardlib/items/
ItemGroup.java 38 private static int binarySearch(SparseIntArray array, int value) {
314 int result = binarySearch(mHierarchyStart, position);
  /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
CollationFastLatinBuilder.java 40 * Like Java Collections.binarySearch(List, String, Comparator).
45 private static final int binarySearch(long[] list, int limit, long ce) {
393 int i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
401 int index = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationFastLatinBuilder.java 39 * Like Java Collections.binarySearch(List, String, Comparator).
44 private static final int binarySearch(long[] list, int limit, long ce) {
392 int i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
400 int index = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
  /external/skia/src/pathops/
SkPathOpsCubic.cpp 30 double SkDCubic::binarySearch(double min, double max, double axisIntercept,
357 double newT = binarySearch(min, max, axisIntercept, xAxis);
  /external/skqp/src/pathops/
SkPathOpsCubic.cpp 30 double SkDCubic::binarySearch(double min, double max, double axisIntercept,
357 double newT = binarySearch(min, max, axisIntercept, xAxis);
  /frameworks/base/core/java/com/android/internal/app/procstats/
SparseMappingTable.java 122 final int idx = binarySearch(id);
166 final int idx = binarySearch(id);
228 final int idx = binarySearch(id);
399 private int binarySearch(byte id) {

Completed in 871 milliseconds

1 2 3 4 5 6 7 8 91011>>