diff options
| author | Alex Auvolat <alex@adnab.me> | 2016-07-13 23:11:55 +0200 |
|---|---|---|
| committer | Alex Auvolat <alex@adnab.me> | 2016-07-13 23:11:55 +0200 |
| commit | d09f8a08bdd9477bd463a2de03397ff56b5ce75d (patch) | |
| tree | 4818750ff1fccd02f24e6f2089937190d2e6724b /src/tests/ktests/btree2 | |
| parent | 8a89ad4b01bafcdb64349e81fb4883a6c5f45187 (diff) | |
| download | kogata-d09f8a08bdd9477bd463a2de03397ff56b5ce75d.tar.gz kogata-d09f8a08bdd9477bd463a2de03397ff56b5ce75d.zip | |
Add delta wrt. function in stack dump
Diffstat (limited to 'src/tests/ktests/btree2')
| -rw-r--r-- | src/tests/ktests/btree2/test.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/tests/ktests/btree2/test.c b/src/tests/ktests/btree2/test.c index 9e105a9..dd62237 100644 --- a/src/tests/ktests/btree2/test.c +++ b/src/tests/ktests/btree2/test.c @@ -24,8 +24,8 @@ void test_btree_2() { for (int i = 0; i < n; i++) { ASSERT(btree_find(ht, (void*)k[i]) == (void*)v[i]); - ASSERT(btree_lower(ht, (void*)k[i]) == (void*)v[i]); - ASSERT(btree_upper(ht, (void*)k[i]) == (void*)v[i]); + ASSERT(btree_lower(ht, (void*)k[i], 0) == (void*)v[i]); + ASSERT(btree_upper(ht, (void*)k[i], 0) == (void*)v[i]); } // random lower bound/upper bound tests @@ -38,8 +38,8 @@ void test_btree_2() { } dbg_printf("random %d : lower %d (= %d), upper %d (= %d) ; ", xk, k[ilower], v[ilower], k[iupper], v[iupper]); - const uint32_t bt_lower = (uint32_t)btree_lower(ht, (void*)xk); - const uint32_t bt_upper = (uint32_t)btree_upper(ht, (void*)xk); + const uint32_t bt_lower = (uint32_t)btree_lower(ht, (void*)xk, 0); + const uint32_t bt_upper = (uint32_t)btree_upper(ht, (void*)xk, 0); dbg_printf("got lower %d, upper %d\n", bt_lower, bt_upper); ASSERT(bt_lower == (ilower == -1 ? 0 : v[ilower]));; ASSERT(bt_upper == (iupper == -1 ? 0 : v[iupper]));; |