asmhatreandClaude Sonnet 5.5
0457cf4bfb
Co-Authored-By: Claude Sonnet 5.5 <[email protected]> Claude-Session: https://claude.ai/code/session_017ic4b4VQVEJWetTT1dYzyJ
10 lines
651 B
Plaintext
10 lines
651 B
Plaintext
Keys 0..2047 that land in segment 0 of 16: how many distinct buckets of that segment's 128-slot HashMap do they use?
|
|
====================================================================================================
|
|
|
|
(bucket = (h ^ (h >>> 16)) & 127, the formula java.util.HashMap uses; computed arithmetically, not by reflection)
|
|
|
|
LOW_BITS keys in segment 0: 128 buckets used: 8 of 128 longest bucket: 16 keys
|
|
MIXED keys in segment 0: 129 buckets used: 65 of 128 longest bucket: 4 keys
|
|
|
|
Each of those 8 buckets holds 16 keys: past the treeify threshold of 8 (the table has >= 64 slots), so java.util.HashMap turns them into trees.
|