| /libcore/ojluni/src/main/java/java/util/ |
| H A D | NavigableMap.java | 69 * {@link #pollFirstEntry}, {@link #lastEntry}, and
239 Map.Entry<K,V> pollFirstEntry(); method in interface:NavigableMap
|
| H A D | TreeSet.java | 454 Map.Entry<E,?> e = m.pollFirstEntry();
|
| H A D | Collections.java | 1974 public Entry<K, V> pollFirstEntry() method in class:Collections.UnmodifiableNavigableMap
2928 public Entry<K, V> pollFirstEntry() method in class:Collections.SynchronizedNavigableMap
2929 { synchronized (mutex) { return nm.pollFirstEntry(); } }
4147 public Entry<K, V> pollFirstEntry() { method in class:Collections.CheckedNavigableMap
4148 Entry<K,V> entry = nm.pollFirstEntry();
|
| H A D | TreeMap.java | 674 public Map.Entry<K,V> pollFirstEntry() { method in class:TreeMap
1148 Map.Entry<E,?> e = m.pollFirstEntry();
1582 public final Map.Entry<K,V> pollFirstEntry() { method in class:TreeMap.NavigableSubMap
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | TreeSubMapTest.java | 317 * pollFirstEntry returns entries in order
321 Map.Entry e = map.pollFirstEntry();
324 e = map.pollFirstEntry();
327 e = map.pollFirstEntry();
330 e = map.pollFirstEntry();
333 e = map.pollFirstEntry();
342 e = map.pollFirstEntry();
869 * pollFirstEntry returns entries in order
873 Map.Entry e = map.pollFirstEntry();
876 e = map.pollFirstEntry();
[all...] |
| H A D | ConcurrentSkipListSubMapTest.java | 430 * pollFirstEntry returns entries in order
434 Map.Entry e = map.pollFirstEntry();
437 e = map.pollFirstEntry();
440 e = map.pollFirstEntry();
443 e = map.pollFirstEntry();
446 e = map.pollFirstEntry();
452 e = map.pollFirstEntry();
1104 * pollFirstEntry returns entries in order
1108 Map.Entry e = map.pollFirstEntry();
1111 e = map.pollFirstEntry();
[all...] |
| H A D | ConcurrentSkipListMapTest.java | 622 * pollFirstEntry returns entries in order
626 Map.Entry e = map.pollFirstEntry();
629 e = map.pollFirstEntry();
632 e = map.pollFirstEntry();
635 e = map.pollFirstEntry();
638 e = map.pollFirstEntry();
644 e = map.pollFirstEntry();
|
| H A D | TreeMapTest.java | 503 * pollFirstEntry returns entries in order
507 Map.Entry e = map.pollFirstEntry();
510 e = map.pollFirstEntry();
513 e = map.pollFirstEntry();
516 e = map.pollFirstEntry();
519 e = map.pollFirstEntry();
525 e = map.pollFirstEntry();
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentSkipListSet.java | 378 Map.Entry<E,Object> e = m.pollFirstEntry();
|
| H A D | ConcurrentSkipListMap.java | 2247 public Map.Entry<K,V> pollFirstEntry() { method in class:ConcurrentSkipListMap
2376 Map.Entry<K,V> e = m.pollFirstEntry();
3041 public Map.Entry<K,V> pollFirstEntry() { method in class:ConcurrentSkipListMap.SubMap
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| H A D | TreeMapTest.java | 937 * {@link java.util.TreeMap#pollFirstEntry()
943 assertEquals(objArray[0].toString(), tm.pollFirstEntry().getKey());
944 assertEquals(objArray[1], tm.pollFirstEntry().getValue());
945 assertEquals(objArray[10], tm.pollFirstEntry().getValue());
948 assertEquals(testint.toString(), tm.pollFirstEntry().getKey());
949 assertEquals(testint10000, tm.pollFirstEntry().getValue());
951 assertEquals(testint9999.toString(), tm.pollFirstEntry().getKey());
952 Entry entry = tm.pollFirstEntry();
956 assertNull(tm.pollFirstEntry());
|
| H A D | TreeMapExtendTest.java | 120 assertNull(treeMap.pollFirstEntry());
1724 .pollFirstEntry().getValue());
1726 .pollFirstEntry().getValue());
1728 .pollFirstEntry().getValue());
1730 .pollFirstEntry().getValue());
2368 assertEquals(999, decendingMap.pollFirstEntry().getValue());
2371 assertEquals(108, decendingMap.pollFirstEntry().getValue());
2374 assertEquals(109, decendingMap.pollFirstEntry().getValue());
2377 assertEquals(107, decendingMap.pollFirstEntry().getValue());
2380 assertEquals(106, decendingMap.pollFirstEntry()
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | TreeMapTest.java | 131 assertImmutable(map.pollFirstEntry());
|