From 730fc4e9bae5a157c83db8061c2c6831a297e959 Mon Sep 17 00:00:00 2001 From: Douglas Rumbaugh Date: Wed, 7 Jun 2023 12:23:38 -0400 Subject: Interface adjustments Layout and Delete Policies are now specified via template parameters, and rejection sampling has been removed as an argument to the mutable buffer constructor. --- tests/testing.h | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'tests/testing.h') diff --git a/tests/testing.h b/tests/testing.h index 4277015..fe6623e 100644 --- a/tests/testing.h +++ b/tests/testing.h @@ -78,7 +78,7 @@ static bool roughly_equal(int n1, int n2, size_t mag, double epsilon) { template static de::MutableBuffer *create_test_mbuffer(size_t cnt) { - auto buffer = new de::MutableBuffer(cnt, true, cnt); + auto buffer = new de::MutableBuffer(cnt, cnt); R rec; for (size_t i = 0; i < cnt; i++) { @@ -99,7 +99,7 @@ template static de::MutableBuffer *create_sequential_mbuffer(decltype(R::key) start, decltype(R::key) stop) { size_t cnt = stop - start; - auto buffer = new de::MutableBuffer(cnt, true, cnt); + auto buffer = new de::MutableBuffer(cnt, cnt); for (size_t i=start; i *create_sequential_mbuffer(decltype(R::key) start, d template static de::MutableBuffer *create_test_mbuffer_tombstones(size_t cnt, size_t ts_cnt) { - auto buffer = new de::MutableBuffer(cnt, true, ts_cnt); + auto buffer = new de::MutableBuffer(cnt, ts_cnt); std::vector> tombstones; @@ -150,7 +150,7 @@ static de::MutableBuffer *create_test_mbuffer_tombstones(size_t cnt, size_t t template static de::MutableBuffer *create_weighted_mbuffer(size_t cnt) { - auto buffer = new de::MutableBuffer(cnt, true, cnt); + auto buffer = new de::MutableBuffer(cnt, cnt); // Put in half of the count with weight one. for (uint32_t i=0; i< cnt / 2; i++) { @@ -173,7 +173,7 @@ static de::MutableBuffer *create_weighted_mbuffer(size_t cnt) template static de::MutableBuffer *create_double_seq_mbuffer(size_t cnt, bool ts=false) { - auto buffer = new de::MutableBuffer(cnt, true, cnt); + auto buffer = new de::MutableBuffer(cnt, cnt); for (size_t i = 0; i < cnt / 2; i++) { R rec; -- cgit v1.2.3