Files
java-interview-lab/lru-cache/output/02-constant-cost-per-operation.txt
T

10 lines
584 B
Plaintext

Pointer writes per HashMapLruCache operation, by cache size
===========================================================
capacity get(hit) get(miss) put(new) put(new, evicts LRU)
10 6 0 4 6
1000 6 0 4 6
100000 6 0 4 6
get(hit) is measured on the OLDEST key (position n from the front). Cost is 6 writes anyway: the node is reached through the hash index, not by walking the list.