LinkedHashMap.java | 163 * Returns the eldest entry in the map, or {@code null} if the map is empty. 166 public Entry<K, V> eldest() { method in class:LinkedHashMap 167 LinkedEntry<K, V> eldest = header.nxt; local 168 return eldest != header ? eldest : null; 172 * Evicts eldest entry if instructed, creates a new entry and links it in 180 * (eldest) entry that happens to be the first entry in the same bucket 187 // Remove eldest entry if instructed to do so. 188 LinkedEntry<K, V> eldest = header.nxt; local 189 if (eldest != header && removeEldestEntry(eldest)) 204 LinkedEntry<K, V> eldest = header.nxt; local [all...] |