Speed up some of our slowest unit tests. (#29414)
`BaseRandomBinaryDocValuesRangeQueryTestCase.testRandomBig` should only run with nightly tests. It doesn't make sense to make it part of every test run. `UUIDTests` had a slow test for compression, which I made a bit faster by decreasing the number of indexed docs.
This commit is contained in:
parent
0f00277851
commit
dfcce2d872
|
@ -41,12 +41,6 @@ public abstract class BaseRandomBinaryDocValuesRangeQueryTestCase extends BaseRa
|
|||
// Can't test this how BaseRangeFieldQueryTestCase works now, because we're using BinaryDocValuesField here.
|
||||
}
|
||||
|
||||
@Override
|
||||
public void testRandomBig() throws Exception {
|
||||
// Test regardless whether -Dtests.nightly=true has been specified:
|
||||
super.testRandomBig();
|
||||
}
|
||||
|
||||
@Override
|
||||
protected final Field newRangeField(Range box) {
|
||||
AbstractRange<?> testRange = (AbstractRange<?>) box;
|
||||
|
|
|
@ -120,9 +120,9 @@ public class UUIDTests extends ESTestCase {
|
|||
Logger logger = Loggers.getLogger(UUIDTests.class);
|
||||
// Low number so that the test runs quickly, but the results are more interesting with larger numbers
|
||||
// of indexed documents
|
||||
assertThat(testCompression(500000, 10000, 3, logger), Matchers.lessThan(12d)); // ~10.8 in practice
|
||||
assertThat(testCompression(500000, 1000, 3, logger), Matchers.lessThan(14d)); // ~11.5 in practice
|
||||
assertThat(testCompression(500000, 100, 3, logger), Matchers.lessThan(21d)); // ~19.5 in practice
|
||||
assertThat(testCompression(100000, 10000, 3, logger), Matchers.lessThan(14d)); // ~12 in practice
|
||||
assertThat(testCompression(100000, 1000, 3, logger), Matchers.lessThan(15d)); // ~13 in practice
|
||||
assertThat(testCompression(100000, 100, 3, logger), Matchers.lessThan(21d)); // ~20 in practice
|
||||
}
|
||||
|
||||
private static double testCompression(int numDocs, int numDocsPerSecond, int numNodes, Logger logger) throws Exception {
|
||||
|
|
Loading…
Reference in New Issue