diff options
| author | David Robillard <d@drobilla.net> | 2023-08-23 17:58:15 -0400 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2023-08-23 18:58:46 -0400 |
| commit | 1420be7916429425f826a214d2bc7e1e19ae11e8 (patch) | |
| tree | 4e7b6acb766d54bc559b810a3ef617c2c78d597c /test/test_btree.c | |
| parent | 4f1822cd1e428252b0dfc5ba88c1147e91aa7aa8 (diff) | |
| download | zix-1420be7916429425f826a214d2bc7e1e19ae11e8.tar.gz zix-1420be7916429425f826a214d2bc7e1e19ae11e8.tar.bz2 zix-1420be7916429425f826a214d2bc7e1e19ae11e8.zip | |
Improve test coverage
Diffstat (limited to 'test/test_btree.c')
| -rw-r--r-- | test/test_btree.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/test/test_btree.c b/test/test_btree.c index 9694a7b..7392ff8 100644 --- a/test/test_btree.c +++ b/test/test_btree.c @@ -221,9 +221,9 @@ test_remove_cases(void) even multiples. This spreads the load around to hit as many cases as possible. */ - static const uintptr_t s1 = 2U; - static const uintptr_t s2 = 255U; - const size_t n_insertions = s1 * s2 * 1000U; + static const uintptr_t s1 = 3U; + static const uintptr_t s2 = 511U; + const size_t n_insertions = s1 * s2 * 450U; ZixBTree* const t = zix_btree_new(NULL, int_cmp, NULL); @@ -628,9 +628,9 @@ main(int argc, char** argv) test_remove_cases(); test_failed_alloc(); - const unsigned n_tests = 3U; + const unsigned n_tests = 2U; const size_t n_elems = - (argc > 1) ? zix_test_size_arg(argv[1], 4U, 1U << 20U) : 131072U; + (argc > 1) ? zix_test_size_arg(argv[1], 4U, 1U << 20U) : (1U << 16U); printf("Running %u tests with %zu elements", n_tests, n_elems); for (unsigned i = 0; i < n_tests; ++i) { |