diff options
| author | Douglas B. Rumbaugh <dbr4@psu.edu> | 2024-05-14 16:31:05 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-05-14 16:31:05 -0400 |
| commit | 47916da2ba5ed5bee2dda3cbcc58d39e1e931bfc (patch) | |
| tree | ee5613ce182b2c9caa228d3abeb65dc27fef2db3 /tests/include/rangequery.h | |
| parent | 4a834497d5f82c817d634925250158d85ca825c2 (diff) | |
| parent | 8643fe194dec05b4e3f3ea31e162ac0b2b00e162 (diff) | |
| download | dynamic-extension-47916da2ba5ed5bee2dda3cbcc58d39e1e931bfc.tar.gz | |
Merge pull request #4 from dbrumbaugh/master
Updates for VLDB revision
Diffstat (limited to 'tests/include/rangequery.h')
| -rw-r--r-- | tests/include/rangequery.h | 21 |
1 files changed, 7 insertions, 14 deletions
diff --git a/tests/include/rangequery.h b/tests/include/rangequery.h index a8a73f7..f90e107 100644 --- a/tests/include/rangequery.h +++ b/tests/include/rangequery.h @@ -39,9 +39,7 @@ START_TEST(t_range_query) auto buffer = create_sequential_mbuffer<R>(100, 1000); auto shard = Shard(buffer->get_buffer_view()); - rq::Parms<R> parms; - parms.lower_bound = 300; - parms.upper_bound = 500; + rq::Parms<R> parms = {300, 500}; auto state = rq::Query<R, Shard>::get_query_state(&shard, &parms); auto result = rq::Query<R, Shard>::query(&shard, state, &parms); @@ -62,9 +60,7 @@ START_TEST(t_buffer_range_query) { auto buffer = create_sequential_mbuffer<R>(100, 1000); - rq::Parms<R> parms; - parms.lower_bound = 300; - parms.upper_bound = 500; + rq::Parms<R> parms = {300, 500}; { auto view = buffer->get_buffer_view(); @@ -92,9 +88,7 @@ START_TEST(t_range_query_merge) auto shard1 = Shard(buffer1->get_buffer_view()); auto shard2 = Shard(buffer2->get_buffer_view()); - rq::Parms<R> parms; - parms.lower_bound = 150; - parms.upper_bound = 500; + rq::Parms<R> parms = {150, 500}; size_t result_size = parms.upper_bound - parms.lower_bound + 1 - 200; @@ -119,7 +113,8 @@ START_TEST(t_range_query_merge) } } - auto result = rq::Query<R, Shard>::merge(proc_results, nullptr); + std::vector<R> result; + rq::Query<R, Shard>::merge(proc_results, nullptr, result); std::sort(result.begin(), result.end()); ck_assert_int_eq(result.size(), result_size); @@ -149,10 +144,8 @@ START_TEST(t_lower_bound) auto merged = Shard(shards); - for (size_t i=100; i<1000; i++) { - R r; - r.key = i; - r.value = i; + for (uint32_t i=100; i<1000; i++) { + R r = R{i, i}; auto idx = merged.get_lower_bound(i); |