Alawn/Chronicle-Map
1
0
Fork 0
mirror of https://github.com/OpenHFT/Chronicle-Map.git synced 2021-09-13 01:26:12 +00:00
Code Releases Activity

HCOLL-408 Trigger new segment tier allocation on hashLookup overflow

Browse Source
This commit is contained in:
leventov
2015-12-07 12:31:28 +03:00
parent ce45903af7
commit c8483dfb7c
3 changed files with 9 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/net/openhft/chronicle/hash/impl/CompactOffHeapLinearHashTable.java
+2 -1
View File
@@ -26,6 +26,7 @@ public abstract class CompactOffHeapLinearHashTable {
// to fit 64 bits per slot.
public static final int MAX_TIER_CHUNKS = 1 << 30;
public static final int MAX_TIER_ENTRIES = 1 << 29;
public static final double MAX_LOAD_FACTOR = .2/.3;
public static int valueBits(long actualChunksPerSegment) {
@@ -57,7 +58,7 @@ public abstract class CompactOffHeapLinearHashTable {
if (entriesPerSegment < 0L)
throw new IllegalArgumentException("entriesPerSegment should be positive");
long capacity = Maths.nextPower2(entriesPerSegment, 64L);
if (((double) entriesPerSegment) / (double) capacity > 2./3.) {
if (((double) entriesPerSegment) / (double) capacity > MAX_LOAD_FACTOR) {
// hash lookup shouldn't be too dense
capacity <<= 1L;
}