honeymoose
/
OpenSearch
mirror of https://github.com/honeymoose/OpenSearch.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[TEST] use randomPositiveLong where possible

This commit is contained in:
javanna 2016-09-01 19:11:01 +02:00 committed by Luca Cavanna
parent 774244a61f
commit 68eb58f9e3
2 changed files with 2 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
core/src/test/java/org/elasticsearch/common/unit/ByteSizeValueTests.java
View File

@ -171,12 +171,7 @@ public class ByteSizeValueTests extends ESTestCase {
} }
public void testSerialization() throws IOException { public void testSerialization() throws IOException {
//negative values cannot be serialized at the moment, we do abs but that is not enough with Long.MIN_VALUE ByteSizeValue byteSizeValue = new ByteSizeValue(randomPositiveLong(), randomFrom(ByteSizeUnit.values()));
long l = Long.MIN_VALUE;
while (l == Long.MIN_VALUE) {
l = randomLong();
}
ByteSizeValue byteSizeValue = new ByteSizeValue(Math.abs(l), randomFrom(ByteSizeUnit.values()));
try (BytesStreamOutput out = new BytesStreamOutput()) { try (BytesStreamOutput out = new BytesStreamOutput()) {
byteSizeValue.writeTo(out); byteSizeValue.writeTo(out);
try (StreamInput in = out.bytes().streamInput()) { try (StreamInput in = out.bytes().streamInput()) {

6
core/src/test/java/org/elasticsearch/monitor/os/OsInfoTests.java
View File

@ -34,11 +34,7 @@ public class OsInfoTests extends ESTestCase {
if (randomBoolean()) { if (randomBoolean()) {
refreshInterval = -1; refreshInterval = -1;
} else { } else {
refreshInterval = randomLong(); refreshInterval = randomPositiveLong();
while (refreshInterval == Long.MIN_VALUE) {
refreshInterval = randomLong();
}
refreshInterval = Math.abs(refreshInterval);
} }
String name = randomAsciiOfLengthBetween(3, 10); String name = randomAsciiOfLengthBetween(3, 10);
String arch = randomAsciiOfLengthBetween(3, 10); String arch = randomAsciiOfLengthBetween(3, 10);