mirror of
https://github.com/OpenHFT/Chronicle-Map.git
synced 2021-09-13 01:26:12 +00:00
Replace nextPosToSearchFrom with lowestPossiblyFreeChunk semantically, that allows to avoid searching free chunks though a full tier, when segment is tiered, again and again. Also, make chunk block reallocation in innerDefaultReplaceValue() and putValueDeletedEntry() check it doesn't overflow actualChunksPerSegmentTier
This commit is contained in:
@@ -33,11 +33,9 @@ import net.openhft.chronicle.values.Array;
|
||||
import net.openhft.chronicle.values.MaxUtf8Length;
|
||||
import net.openhft.chronicle.values.Range;
|
||||
import net.openhft.chronicle.values.Values;
|
||||
import net.openhft.lang.values.DoubleArray;
|
||||
import org.jetbrains.annotations.NotNull;
|
||||
import org.junit.After;
|
||||
import org.junit.Assert;
|
||||
import org.junit.Ignore;
|
||||
import org.junit.Test;
|
||||
import org.junit.runner.RunWith;
|
||||
import org.junit.runners.Parameterized;
|
||||
@@ -216,7 +214,7 @@ public class CHMUseCasesTest {
|
||||
map1.valueClass())
|
||||
.entriesPerSegment(vanillaMap.entriesPerSegment)
|
||||
.actualSegments(vanillaMap.actualSegments)
|
||||
.actualChunksPerSegment(vanillaMap.actualChunksPerSegment);
|
||||
.actualChunksPerSegmentTier(vanillaMap.actualChunksPerSegmentTier);
|
||||
if (!vanillaMap.constantlySizedEntry) {
|
||||
builder.actualChunkSize((int) vanillaMap.chunkSize);
|
||||
builder.worstAlignment(vanillaMap.worstAlignment);
|
||||
|
||||
Reference in New Issue
Block a user