Searched refs:afterNodeAccess (Results 1 – 4 of 4) sorted by relevance
329 void afterNodeAccess(Node<K,V> e) { // move node to last in afterNodeAccess() method in LinkedHashMap467 afterNodeAccess(e); in get()479 afterNodeAccess(e); in getOrDefault()
656 afterNodeAccess(e); in putVal()1078 afterNodeAccess(e); in replace()1090 afterNodeAccess(e); in replace()1125 afterNodeAccess(old); in computeIfAbsent()1134 afterNodeAccess(old); in computeIfAbsent()1161 afterNodeAccess(e); in computeIfPresent()1203 afterNodeAccess(old); in compute()1261 afterNodeAccess(old); in merge()1778 void afterNodeAccess(Node<K,V> p) { } in afterNodeAccess() method in HashMap
94 void afterNodeAccess(java.util.HashMap.Node<K, V> e) { in afterNodeAccess() method in LinkedHashMap
241 void afterNodeAccess(java.util.HashMap.Node<K, V> p) { in afterNodeAccess() method in HashMap