HomeSort by relevance Sort by last modified time
    Searched full:binarysearch (Results 1 - 25 of 73) sorted by null

1 2 3

  /libcore/luni/src/test/java/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...]
CollectionsTest.java 62 * @tests java.util.Collections#binarySearch(java.util.List,
68 method = "binarySearch",
76 int index = Collections.binarySearch(lst, new Integer(2), null);
88 Collections.binarySearch(ll, new Integer(10), null);
96 * @tests java.util.Collections#binarySearch(java.util.List,
102 method = "binarySearch",
109 assertEquals(-1, Collections.binarySearch(localList, new Object()));
112 Collections.binarySearch(localList, new Integer(1));
127 Collections.binarySearch(ll, new Integer(10));
  /frameworks/base/core/java/android/util/
SparseBooleanArray.java 61 int i = binarySearch(mKeys, 0, mSize, key);
74 int i = binarySearch(mKeys, 0, mSize, key);
89 int i = binarySearch(mKeys, 0, mSize, key);
154 return binarySearch(mKeys, 0, mSize, key);
210 private static int binarySearch(int[] a, int start, int len, int key) {
SparseIntArray.java 60 int i = binarySearch(mKeys, 0, mSize, key);
73 int i = binarySearch(mKeys, 0, mSize, key);
95 int i = binarySearch(mKeys, 0, mSize, key);
160 return binarySearch(mKeys, 0, mSize, key);
216 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) {
SparseArray.java 63 int i = binarySearch(mKeys, 0, mSize, key);
76 int i = binarySearch(mKeys, 0, mSize, key);
137 int i = binarySearch(mKeys, 0, mSize, key);
154 i = ~binarySearch(mKeys, 0, mSize, key);
244 return binarySearch(mKeys, 0, mSize, key);
316 private static int binarySearch(int[] a, int start, int len, int key) {
  /external/guava/src/com/google/common/collect/
ComparatorOrdering.java 43 @Override public int binarySearch(List<? extends T> sortedList, T key) {
44 return Collections.binarySearch(sortedList, key, comparator);
NaturalOrdering.java 51 @Override public int binarySearch(
53 return Collections.binarySearch((List) sortedList, key);
RegularImmutableSortedSet.java 88 return binarySearch(o) >= 0;
130 private int binarySearch(Object key) {
236 int index = binarySearch(element);
260 position = binarySearch(target);
  /frameworks/base/docs/html/sdk/api_diff/9/changes/
java.util.Arrays.html 87 <nobr><code>int</code>&nbsp;<A HREF="../../../../reference/java/util/Arrays.html#binarySearch(T[], int, int, T, java.util.Comparator<? super T>)" target="_top"><code>binarySearch</code></A>(<code>T[],</nobr> int<nobr>,</nobr> int<nobr>,</nobr> T<nobr>,</nobr> Comparator&lt;?<nobr>,</nobr> super<nobr>,</nobr> T&gt;<nobr><nobr></code>)</nobr>
94 <nobr><code>int</code>&nbsp;<A HREF="../../../../reference/java/util/Arrays.html#binarySearch(byte[], int, int, byte)" target="_top"><code>binarySearch</code></A>(<code>byte[],</nobr> int<nobr>,</nobr> int<nobr>,</nobr> byte<nobr><nobr></code>)</nobr>
101 <nobr><code>int</code>&nbsp;<A HREF="../../../../reference/java/util/Arrays.html#binarySearch(char[], int, int, char)" target="_top"><code>binarySearch</code></A>(<code>char[],</nobr> int<nobr>,</nobr> int<nobr>,</nobr> char<nobr><nobr></code>)</nobr>
108 <nobr><code>int</code>&nbsp;<A HREF="../../../../reference/java/util/Arrays.html#binarySearch(double[], int, int, double)" target="_top"><code>binarySearch</code></A>(<code>double[],</nobr> int<nobr>,</nobr> int<nobr>,</nobr> double<nobr><nobr></code>)</nobr>
115 <nobr><code>int</code>&nbsp;<A HREF="../../../../reference/java/util/Arrays.html#binarySearch(float[], int, int, float)" target="_top"><code>binarySearch</code></A>(<code>float[],</nobr> int<nobr>,</nobr> int<nobr>,</nobr> float<nobr><nobr></code>)</no (…)
    [all...]
  /libcore/luni/src/test/java/tests/api/java/util/
ArraysTest.java 109 * @tests java.util.Arrays#binarySearch(byte[], byte)
114 method = "binarySearch",
118 // Test for method int java.util.Arrays.binarySearch(byte [], byte)
121 Arrays.binarySearch(byteArray, counter) == counter);
123 -1, Arrays.binarySearch(intArray, (byte) -1));
126 Arrays.binarySearch(intArray, (byte) arraySize) == -(arraySize + 1));
132 Arrays.binarySearch(byteArray, (byte) (counter - 50)) == counter);
136 * @tests java.util.Arrays#binarySearch(char[], char)
141 method = "binarySearch",
145 // Test for method int java.util.Arrays.binarySearch(char [], char
    [all...]
  /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) {
  /packages/apps/Gallery3D/src/com/cooliris/media/
LongSparseArray.java 70 int i = binarySearch(mKeys, 0, mSize, key);
83 int i = binarySearch(mKeys, 0, mSize, key);
132 int i = binarySearch(mKeys, 0, mSize, key);
149 i = ~binarySearch(mKeys, 0, mSize, key);
239 return binarySearch(mKeys, 0, mSize, key);
309 private static int binarySearch(long[] a, int start, int len, long key) {
  /external/jdiff/src/jdiff/
ClassDiff.java 100 int idx = Collections.binarySearch(newClass.implements_, oldInterface);
113 int idx = Collections.binarySearch(oldClass.implements_, newInterface);
APIComparator.java 59 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...]
  /libcore/luni/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);
  /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);
  /dalvik/dx/src/com/android/dx/util/
ListIntSet.java 39 int index = ints.binarysearch(value);
  /packages/apps/Contacts/src/com/android/contacts/
ContactsSectionIndexer.java 84 int index = Arrays.binarySearch(mPositions, position);
  /libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/
Cache.java 214 int idx = -1*Arrays.binarySearch(hashes_idx, prefix_hash)-1;
238 int idx = -1*Arrays.binarySearch(hashes_idx, hash)-1;
279 int idx = Arrays.binarySearch(hashes_idx, idx_hash);
287 int new_idx = Arrays.binarySearch(hashes_idx, new_hash_idx);
313 int idx = Arrays.binarySearch(hashes_idx, idx_hash);
  /libcore/luni/src/main/java/java/util/
Arrays.java 182 public static int binarySearch(byte[] array, byte value) {
183 return binarySearch(array, 0, array.length, value);
202 public static int binarySearch(byte[] array, int startIndex, int endIndex, byte value) {
232 public static int binarySearch(char[] array, char value) {
233 return binarySearch(array, 0, array.length, value);
252 public static int binarySearch(char[] array, int startIndex, int endIndex, char value) {
282 public static int binarySearch(double[] array, double value) {
283 return binarySearch(array, 0, array.length, value);
302 public static int binarySearch(double[] array, int startIndex, int endIndex, double value) {
343 public static int binarySearch(float[] array, float value)
    [all...]
  /development/tools/zoneinfo/
ZoneInfo.java 183 int trans = Arrays.binarySearch(mTransitions, unix);
208 int trans = Arrays.binarySearch(mTransitions, unix);
  /libcore/luni/src/main/java/org/apache/harmony/luni/internal/util/
ZoneInfo.java 168 int trans = Arrays.binarySearch(mTransitions, unix);
193 int trans = Arrays.binarySearch(mTransitions, unix);
  /libcore/luni/src/test/java/tests/java/sql/
DatabaseMetaDataTest.java 387 assertTrue("Invalid table name", Arrays.binarySearch(
389 assertTrue("Invalid field name", Arrays.binarySearch(fields, rs
391 assertTrue("Invalid nullable value", Arrays.binarySearch(
393 assertTrue("Invalid nullable code", Arrays.binarySearch(
407 assertTrue("Wrong table name", Arrays.binarySearch(tablesName,
422 assertTrue("Wrong table name", Arrays.binarySearch(tablesName,
    [all...]

Completed in 686 milliseconds

1 2 3