Fix a heuristic in VanillaChronicleHash.computeNumberOfTiersInBulk()

This commit is contained in:
leventov
2016-01-06 00:37:37 +03:00
parent 97e4c12de1
commit ebee1d36c3
@@ -355,7 +355,7 @@ public abstract class VanillaChronicleHash<K,
// TODO review heuristics
int tiersInBulk = actualSegments / 8;
tiersInBulk = Maths.nextPower2(tiersInBulk, 1);
while (tierSize * tiersInBulk < OS.pageSize()) {
while (computeTierBulkBytesSize(tiersInBulk) < OS.pageSize()) {
tiersInBulk *= 2;
}
return tiersInBulk;