Files
java-interview-lab/hashmap-vs-concurrenthashmap/output/03-treeify-compare.txt
T

17 lines
1.2 KiB
Plaintext

12 colliding keys (all hashCode()==1, so bin index 1) inserted into HashMap and ConcurrentHashMap
=================================================================================================
insert | HashMap table[1] (length) | ConcurrentHashMap table[1] (length, sizeCtl)
#1 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#2 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#3 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#4 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#5 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#6 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#7 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#8 | Node (length 16 ) | Node (length 16 , sizeCtl 12)
#9 | Node (length 32 ) | Node (length 128, sizeCtl 96)
#10 | Node (length 64 ) | TreeBin (length 128, sizeCtl 96)
#11 | TreeNode (length 64 ) | TreeBin (length 128, sizeCtl 96)
#12 | TreeNode (length 64 ) | TreeBin (length 128, sizeCtl 96)