Searched refs:binarySearch (Results 1 - 25 of 85) sorted by relevance

1234

/external/smali/util/src/main/java/org/jf/util/
H A DSparseIntArray.java71 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) { method in class:SparseIntArray
H A DSparseArray.java78 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) { method in class:SparseArray
H A DArraySortedSet.java66 return Arrays.binarySearch((T[])arr, (T)o, comparator) >= 0;
/external/protobuf/javanano/src/main/java/com/google/protobuf/nano/
H A DFieldArray.java75 int i = binarySearch(fieldNumber);
88 int i = binarySearch(fieldNumber);
125 int i = binarySearch(fieldNumber);
142 i = ~ binarySearch(fieldNumber);
240 private int binarySearch(int value) { method in class:FieldArray
/external/guava/guava/src/com/google/common/collect/
H A DSortedLists.java169 * {@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, method in class:SortedLists
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, method in class:SortedLists
205 return binarySearch(
218 * {@link #binarySearch(List, Object, Comparator, KeyPresentBehavior, KeyAbsentBehavior)} using
221 public static <E, K> int binarySearch( method in class:SortedLists
228 return binarySearch(
255 public static <E> int binarySearch(List<? extends E> list, @Nullable E key, method in class:SortedLists
[all...]
H A DRegularImmutableSortedSet.java137 return Collections.binarySearch(elements, key, unsafeComparator());
224 return SortedLists.binarySearch(
242 return SortedLists.binarySearch(
274 position = SortedLists.binarySearch(elements, target, unsafeComparator(),
H A DImmutableRangeMap.java165 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(),
178 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(),
235 int lowerIndex = SortedLists.binarySearch(
238 int upperIndex = SortedLists.binarySearch(ranges,
H A DImmutableRangeSet.java116 int index = SortedLists.binarySearch(ranges,
127 int index = SortedLists.binarySearch(ranges,
269 fromIndex = SortedLists.binarySearch(
278 toIndex = SortedLists.binarySearch(
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowSparseArray.java82 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) { method in class:ShadowSparseArray
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DSortedListsTest.java98 SortedLists.binarySearch(LIST_WITHOUT_DUPS, key, presentBehavior, absentBehavior),
110 SortedLists.binarySearch(LIST_WITH_DUPS, key, presentBehavior, absentBehavior),
/external/guava/guava-tests/test/com/google/common/collect/
H A DSortedListsTest.java100 SortedLists.binarySearch(LIST_WITHOUT_DUPS, key, presentBehavior, absentBehavior),
112 SortedLists.binarySearch(LIST_WITH_DUPS, key, presentBehavior, absentBehavior),
/external/jdiff/src/jdiff/
H A DClassDiff.java100 int idx = Collections.binarySearch(newClass.implements_, oldInterface);
113 int idx = Collections.binarySearch(oldClass.implements_, newInterface);
H A DAPIComparator.java59 int idx = Collections.binarySearch(newAPI.packages_, oldPkg);
88 int idx = Collections.binarySearch(oldAPI.packages_, newPkg);
166 int idx = Collections.binarySearch(newPkg.classes_, oldClass);
194 int idx = Collections.binarySearch(oldPkg.classes_, newClass);
374 int idx = Collections.binarySearch(newClass.ctors_, oldCtor);
423 int idx = Collections.binarySearch(oldClass.ctors_, newCtor);
474 // NOTE: there was a problem with the binarySearch for
479 // int idx = Collections.binarySearch(newClass.methods_, oldMethod);
497 // has changed, because the binarySearch did not find it.
534 // See note above about searching an array instead of binarySearch
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DSpriteAnimation.java62 int index = Arrays.binarySearch(mFrameStartTimes, cycleTime);
H A DFixedSizeArray.java202 index = Arrays.binarySearch(contents, object, comparator);
204 index = Arrays.binarySearch(contents, object);
206 // Arrays.binarySearch() returns a negative insertion index if the object isn't found,
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/util/
H A DInstructionOffsetMap.java59 int index = Arrays.binarySearch(instructionCodeOffsets, codeOffset);
/external/volley/src/main/java/com/android/volley/toolbox/
H A DByteArrayPool.java115 int pos = Collections.binarySearch(mBuffersBySize, buf, BUF_COMPARATOR);
/external/libphonenumber/internal/prefixmapper/src/com/google/i18n/phonenumbers/prefixmapper/
H A DPhonePrefixMap.java161 currentIndex = binarySearch(0, currentIndex, phonePrefix);
192 private int binarySearch(int start, int end, long value) { method in class:PhonePrefixMap
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DTrie.java125 int i = Arrays.binarySearch(childMap, ch);
145 return Arrays.binarySearch(childMap, ch) >= 0;
/external/smali/util/src/test/java/org/jf/util/
H A DLinearSearchTest.java97 int expectedIndex = Ordering.natural().binarySearch(list, key);
/external/icu/icu4c/source/i18n/
H A Dmeasunit.cpp1066 static int32_t binarySearch( function
1167 int32_t typeIdx = binarySearch(gTypes, 0, UPRV_LENGTHOF(gTypes), type);
1203 int32_t t = binarySearch(gTypes, 0, UPRV_LENGTHOF(gTypes), type);
1207 int32_t st = binarySearch(gSubTypes, gOffsets[t], gOffsets[t + 1], subtype);
1254 int32_t result = binarySearch(gTypes, 0, UPRV_LENGTHOF(gTypes), "duration");
1257 result = binarySearch(gSubTypes, gOffsets[fTypeId], gOffsets[fTypeId + 1], timeId);
1263 int32_t result = binarySearch(gTypes, 0, UPRV_LENGTHOF(gTypes), "currency");
1266 result = binarySearch(
1277 int32_t result = binarySearch(gTypes, 0, UPRV_LENGTHOF(gTypes), "none");
1280 result = binarySearch(gSubType
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
H A DPolynomialSplineFunction.java136 int i = Arrays.binarySearch(knots, v);
/external/skia/src/pathops/
H A DSkPathOpsCubic.h46 double binarySearch(double min, double max, double axisIntercept, SearchAxis xAxis) const;
/external/skqp/src/pathops/
H A DSkPathOpsCubic.h46 double binarySearch(double min, double max, double axisIntercept, SearchAxis xAxis) const;
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DICUBinary.java97 int index = binarySearch(bytes, key);
110 int index = binarySearch(bytes, folder);
123 private static int binarySearch(ByteBuffer bytes, CharSequence key) { method in class:ICUBinary.DatPackageReader

Completed in 1521 milliseconds

1234