diff options
| author | Douglas Rumbaugh <dbr4@psu.edu> | 2024-04-15 14:00:27 -0400 |
|---|---|---|
| committer | Douglas Rumbaugh <dbr4@psu.edu> | 2024-04-15 14:00:27 -0400 |
| commit | b25beb13773072c3b143842b45a7c32a1108f347 (patch) | |
| tree | 97f490a4b8e527e6281df2cb1ee8f1fab84f1f8d /tests/include/rangequery.h | |
| parent | 2c69253f382cd0c6d41db57c45119c33c315bb9c (diff) | |
| download | dynamic-extension-b25beb13773072c3b143842b45a7c32a1108f347.tar.gz | |
Updated FSTrie to use const char * instead of std::string
Note: this requires the caller to manage the memory of the strings
Diffstat (limited to 'tests/include/rangequery.h')
| -rw-r--r-- | tests/include/rangequery.h | 18 |
1 files changed, 5 insertions, 13 deletions
diff --git a/tests/include/rangequery.h b/tests/include/rangequery.h index a8a73f7..a3b761e 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; @@ -149,10 +143,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); |