Searched defs:eldest (Results 1 - 2 of 2) sorted by relevance
/libcore/luni/src/test/java/libcore/java/util/ |
H A D | LinkedHashMapTest.java | 233 protected boolean removeEldestEntry(Entry eldest) { 293 assertNull(eldest(emptyMap)); 297 assertEntry("key", "value", eldest(createMap("key", "value"))); 298 assertEntry("A", "1", eldest(createMap("A", "1", "B", "2", "C", "3"))); 299 assertEntry("A", "4", eldest(createMap("A", "1", "B", "2", "C", "3", "A", "4"))); 300 assertEntry("A", "4", eldest(createMap("A", "1", "B", "2", "C", "3", "A", "4", "D", "5"))); 324 assertEntry(expectedKey, expectedValue, eldest(map)); 326 assertNull(eldest(map)); 422 private static Map.Entry<?, ?> eldest(LinkedHashMap<?,?> map) { method in class:LinkedHashMapTest 424 return map.eldest(); [all...] |
/libcore/ojluni/src/main/java/java/util/ |
H A D | LinkedHashMap.java | 226 * The head (eldest) of the doubly linked list. 321 void afterNodeInsertion(boolean evict) { // possibly remove eldest 491 // Android-added: eldest(), for internal use in LRU caches 493 * Returns the eldest entry in the map, or {@code null} if the map is empty. 496 public Map.Entry<K, V> eldest() { method in class:LinkedHashMap 501 * Returns <tt>true</tt> if this map should remove its eldest entry. 504 * with the opportunity to remove the eldest entry each time a new one 509 * entries and then delete the eldest entry each time a new entry is 514 * protected boolean removeEldestEntry(Map.Entry eldest) { 528 * map acts like a normal map - the eldest elemen 541 removeEldestEntry(Map.Entry<K,V> eldest) argument [all...] |
Completed in 109 milliseconds