| /libcore/ojluni/src/main/java/java/util/ |
| H A D | Collections.java | 73 * <a href="{@docRoot}openjdk-redirect.html?v=8&path=/technotes/guides/collections/index.html">
239 * @return the index of the search key, if it is contained in the list;
242 * key would be inserted into the list: the index of the first
306 private static <T> T get(ListIterator<? extends T> i, int index) { argument
309 if (pos <= index) {
312 } while (pos++ < index);
316 } while (--pos > index);
343 * @return the index of the search key, if it is contained in the list;
346 * key would be inserted into the list: the index of the first
526 * @param i the index o
1351 get(int index) argument
1352 set(int index, E element) argument
1355 add(int index, E element) argument
1358 remove(int index) argument
1363 addAll(int index, Collection<? extends E> c) argument
1378 listIterator(final int index) argument
2460 get(int index) argument
2463 set(int index, E element) argument
2466 add(int index, E element) argument
2469 remove(int index) argument
2480 addAll(int index, Collection<? extends E> c) argument
2488 listIterator(int index) argument
3475 get(int index) argument
3476 remove(int index) argument
3480 set(int index, E element) argument
3484 add(int index, E element) argument
3488 addAll(int index, Collection<? extends E> c) argument
3493 listIterator(final int index) argument
4501 get(int index) argument
4861 get(int index) argument
5070 get(int index) argument
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentHashMap.java | 383 * either stay at same index, or move with a power of two
690 * never be used in index calculations because of table bounds.
750 * equivalent check), thus ensuring that any index argument taking
752 * index. Note that, to be correct wrt arbitrary concurrency
806 * The next table index (plus one) to split while resizing.
2668 * Replaces all linked nodes in bin at given index unless table is
2671 private final void treeifyBin(Node<K,V>[] tab, int index) { argument
2676 else if ((b = tabAt(tab, index)) != null && b.hash >= 0) {
2678 if (tabAt(tab, index) == b) {
2690 setTabAt(tab, index, ne
3324 int index; field in class:ConcurrentHashMap.TableStack
3354 int index; // index of bin to use next field in class:ConcurrentHashMap.Traverser
3359 Traverser(Node<K,V>[] tab, int size, int index, int limit) argument
3445 BaseIterator(Node<K,V>[] tab, int size, int index, int limit, ConcurrentHashMap<K,V> map) argument
3466 KeyIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument
3486 ValueIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument
3506 EntryIterator(Node<K,V>[] tab, int index, int size, int limit, ConcurrentHashMap<K,V> map) argument
3571 KeySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3610 ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit, long est) argument
3649 EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit, long est, ConcurrentHashMap<K,V> map) argument
4879 int index; field in class:ConcurrentHashMap.BulkTask
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | ArraysTest.java | 1624 assertTrue(array[i - 1].index < array[i].index);
1632 public int index; field in class:ArraysTest.Element
1638 index = count++;
1992 private void orderFail(int index, String value1, String value2) { argument
1993 fail("Array is not sorted at " + index + "-th position: " + value1 + " and " + value2);
|
| /libcore/luni/src/main/native/ |
| H A D | libcore_io_Linux.cpp | 1292 int index = 0; local
1306 env->SetObjectArrayElement(result, index, inetAddress.get());
1307 ++index;
1545 int index = 0; local
1546 for (ifaddrs* ifa = ifaddr; ifa != NULL; ifa = ifa->ifa_next, ++index) {
1612 env->SetObjectArrayElement(result, index, o);
1618 static jstring Linux_if_indextoname(JNIEnv* env, jobject, jint index) { argument
1620 char* name = if_indextoname(index, buf);
|
| /libcore/ojluni/src/main/java/java/lang/ |
| H A D | Character.java | 4508 int index = Arrays.binarySearch(scriptStarts, codePoint);
4509 if (index < 0)
4510 index = -index - 2;
4511 return scripts[index];
4869 * Returns the code point at the given index of the
4871 * the given index in the {@code CharSequence} is in the
4872 * high-surrogate range, the following index is less than the
4874 * {@code char} value at the following index is in the
4877 * the {@code char} value at the given index i
4890 codePointAt(CharSequence seq, int index) argument
4922 codePointAt(char[] a, int index) argument
4951 codePointAt(char[] a, int index, int limit) argument
4959 codePointAtImpl(char[] a, int index, int limit) argument
4991 codePointBefore(CharSequence seq, int index) argument
5023 codePointBefore(char[] a, int index) argument
5054 codePointBefore(char[] a, int index, int start) argument
5062 codePointBeforeImpl(char[] a, int index, int start) argument
5201 toSurrogates(int codePoint, char[] dst, int index) argument
5307 offsetByCodePoints(CharSequence seq, int index, int codePointOffset) argument
5374 offsetByCodePoints(char[] a, int start, int count, int index, int codePointOffset) argument
5383 offsetByCodePointsImpl(char[]a, int start, int count, int index, int codePointOffset) argument
[all...] |
| /libcore/support/src/test/java/tests/resources/ |
| H A D | junit4-4.3.1.jar | META-INF/ META-INF/MANIFEST.MF junit/ junit/extensions/ junit/framework/ junit/runner/ junit/textui/ org/ ... |