asmhatreandClaude Sonnet 5.5
0457cf4bfb
Co-Authored-By: Claude Sonnet 5.5 <[email protected]> Claude-Session: https://claude.ai/code/session_017ic4b4VQVEJWetTT1dYzyJ
13 lines
1.1 KiB
Plaintext
13 lines
1.1 KiB
Plaintext
LinkedHashMap(accessOrder=true), start [1, 2, 3] (LRU -> MRU): does the call move key 1?
|
|
========================================================================================
|
|
|
|
get(1) -> order [2, 3, 1] key 1 moved to MRU end: true
|
|
put(1, "x") (existing key) -> order [2, 3, 1] key 1 moved to MRU end: true
|
|
getOrDefault(1, "-") -> order [2, 3, 1] key 1 moved to MRU end: true
|
|
putIfAbsent(1, "x") (key present) -> order [2, 3, 1] key 1 moved to MRU end: true
|
|
computeIfAbsent(1, k -> "x") (key present) -> order [2, 3, 1] key 1 moved to MRU end: true
|
|
containsKey(1) -> order [1, 2, 3] key 1 moved to MRU end: false
|
|
keySet() iteration -> order [1, 2, 3] key 1 moved to MRU end: false
|
|
entrySet() iteration -> order [1, 2, 3] key 1 moved to MRU end: false
|
|
size() -> order [1, 2, 3] key 1 moved to MRU end: false
|