diff options
author | Brian Gianforcaro <bgianf@serenityos.org> | 2021-09-05 12:52:40 -0700 |
---|---|---|
committer | Andreas Kling <kling@serenityos.org> | 2021-09-05 22:17:28 +0200 |
commit | 782e7834c38f1abf5ab6ac9f741a3119c72f947a (patch) | |
tree | efc0d2f2d444c87099a8569722d8dda62ae8ecc1 | |
parent | bb58a4d94394ae19e0b850b15cfb105c91a1ee7b (diff) | |
download | serenity-782e7834c38f1abf5ab6ac9f741a3119c72f947a.zip |
Tests: Reduce the execution time of the LibC TestQSort test
Executing 100 times vs 10 times doesn't increase test coverage
substantial, this API is stable and more iterations is just a
waste of time.
Without KVM this test is a clear outlier in runtime during CI:
```
START LibC/TestQsort (106/172)
PASS LibC/TestQsort (41.233692s)
```
-rw-r--r-- | Tests/LibC/TestQsort.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Tests/LibC/TestQsort.cpp b/Tests/LibC/TestQsort.cpp index 204d0e6f75..5a194d6b24 100644 --- a/Tests/LibC/TestQsort.cpp +++ b/Tests/LibC/TestQsort.cpp @@ -12,7 +12,7 @@ #include <AK/Vector.h> #include <stdlib.h> -const size_t NUM_RUNS = 100; +const size_t NUM_RUNS = 10; struct SortableObject { int m_key; |