From ef2dbf89ee9925e8116ab4ca7684b97711f6859c Mon Sep 17 00:00:00 2001 From: Patrick Pelissier Date: Mon, 8 Jul 2019 11:36:09 +0200 Subject: [PATCH] Improve test --- tests/test-mbptree.c | 33 +++++++++++++++++++-------------- 1 file changed, 19 insertions(+), 14 deletions(-) diff --git a/tests/test-mbptree.c b/tests/test-mbptree.c index da724bd0..5ec86695 100644 --- a/tests/test-mbptree.c +++ b/tests/test-mbptree.c @@ -253,21 +253,26 @@ static void test3_string(void) btree_string_t b; btree_string_init(b); - for(int i = 0; i < 1000; i++) { - string_printf(key, "%d", i); - string_printf(value, "%d", 1000*i); - btree_string_set_at(b, key, value); - assert(string_equal_p(value, *btree_string_cget(b, key))); + const int prime[6] = { 1, 3, 5, 11, 13, 17}; + const int prime_size = 6; + for(int k = 0; k < prime_size; k++) { + int p = prime[k]; + for(int i = 0; i < 1000; i++) { + string_printf(key, "%d", (i*p) % 1024); + string_printf(value, "%d", 1000*i); + btree_string_set_at(b, key, value); + assert(string_equal_p(value, *btree_string_cget(b, key))); + } + assert(btree_string_size(b) == 1000); + for(int i = 0; i < 1000; i++) { + string_printf(key, "%d", (i*p) % 1024); + string_printf(value, "%d", 1000*i); + assert(string_equal_p(value, *btree_string_cget(b, key))); + bool r = btree_string_erase(b, key); + assert (r == true); + } + assert(btree_string_size(b) == 0); } - assert(btree_string_size(b) == 1000); - for(int i = 0; i < 1000; i++) { - string_printf(key, "%d", i); - string_printf(value, "%d", 1000*i); - assert(string_equal_p(value, *btree_string_cget(b, key))); - bool r = btree_string_erase(b, key); - assert (r == true); - } - assert(btree_string_size(b) == 0); btree_string_clear(b); string_clear(key);