mirror of
https://github.com/OpenHFT/Chronicle-Map.git
synced 2021-09-13 01:26:12 +00:00
remove comments
This commit is contained in:
@@ -191,7 +191,6 @@ public final class SerializationBuilder<T> implements Cloneable {
|
||||
}
|
||||
|
||||
public long constantSizeBySample(T sampleObject) {
|
||||
// TODO mark.price this should probably be maxSize()
|
||||
long constantSize = serializationSize(sampleObject);
|
||||
if (constantSizeMarshaller() && !DynamicallySized.class.isAssignableFrom(sampleObject.getClass())) {
|
||||
long expectedConstantSize = constantSize();
|
||||
|
||||
@@ -1826,11 +1826,6 @@ public final class ChronicleMapBuilder<K, V> implements
|
||||
keyBuilder, averageKeySize, averageKey, sampleKey, "Key");
|
||||
averageValueSize = preMapConstruction(
|
||||
valueBuilder, averageValueSize, averageValue, sampleValue, "Value");
|
||||
|
||||
// TODO mark.price
|
||||
// System.out.printf(Thread.currentThread().getName() + "|++!! averageValueSize calculated as %.2f%n",
|
||||
// averageValueSize);
|
||||
|
||||
stateChecks();
|
||||
}
|
||||
|
||||
|
||||
@@ -59,7 +59,7 @@ public class BasicReplicationTest {
|
||||
final Map[] maps = new Map[] {mapOne, mapTwo, mapThree};
|
||||
|
||||
final Random random = new Random(0xBAD5EED);
|
||||
for (int i = 0; i < 50; i++) {
|
||||
for (int i = 0; i < 5; i++) {
|
||||
final int mapIndex = random.nextInt(maps.length);
|
||||
final Map map = maps[mapIndex];
|
||||
final String key = "key" + random.nextInt(100);
|
||||
@@ -68,7 +68,7 @@ public class BasicReplicationTest {
|
||||
System.out.printf("map %d, put(%s, %s)%n", mapIndex, key, value);
|
||||
}
|
||||
|
||||
LockSupport.parkNanos(TimeUnit.DAYS.toNanos(5L));
|
||||
LockSupport.parkNanos(TimeUnit.SECONDS.toNanos(5L));
|
||||
executorService.shutdownNow();
|
||||
|
||||
for(String key : mapOne.keySet()) {
|
||||
|
||||
Reference in New Issue
Block a user