Home
last modified time | relevance | path

Searched refs:binCount (Results 1 – 2 of 2) sorted by relevance

/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentHashMap.java1013 int binCount = 0; in putVal() local
1034 binCount = 1; in putVal()
1035 for (Node<K,V> e = f;; ++binCount) { in putVal()
1054 binCount = 2; in putVal()
1066 if (binCount != 0) { in putVal()
1067 if (binCount >= TREEIFY_THRESHOLD) in putVal()
1075 addCount(1L, binCount); in putVal()
1493 int binCount = 0; in readObject() local
1503 ++binCount; in readObject()
1505 if (insertAtFront && binCount >= TREEIFY_THRESHOLD) { in readObject()
[all …]
/libcore/ojluni/src/main/java/java/util/
DHashMap.java645 for (int binCount = 0; ; ++binCount) { in putVal()
648 if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st in putVal()
1203 int binCount = 0; in computeIfAbsent() local
1220 ++binCount; in computeIfAbsent()
1243 if (binCount >= TREEIFY_THRESHOLD - 1) in computeIfAbsent()
1303 int binCount = 0; in compute() local
1320 ++binCount; in compute()
1341 if (binCount >= TREEIFY_THRESHOLD - 1) in compute()
1368 int binCount = 0; in merge() local
1385 ++binCount; in merge()
[all …]