mirror of
https://github.com/scylladb/scylladb.git
synced 2026-05-12 19:02:12 +00:00
test: perf: perf_collection: use the optimized version of bptree
Since key_compare does not conform to SimpleLessCompare, the benchmark tests the non-optimized version of bptree (without SIMD key search). We want to test the optimized version. Closes #9180
This commit is contained in:
committed by
Avi Kivity
parent
65381bd155
commit
2aa0a2e6a1
@@ -31,6 +31,9 @@ using per_key_t = int64_t;
|
||||
|
||||
struct key_compare {
|
||||
bool operator()(const per_key_t& a, const per_key_t& b) const noexcept { return a < b; }
|
||||
int64_t simplify_key(per_key_t k) noexcept {
|
||||
return k;
|
||||
}
|
||||
};
|
||||
|
||||
struct key_tri_compare {
|
||||
@@ -46,6 +49,8 @@ using namespace seastar;
|
||||
/* On node size 32 and less linear search works better */
|
||||
using test_bplus_tree = bplus::tree<per_key_t, unsigned long, key_compare, 4, bplus::key_search::linear>;
|
||||
|
||||
static_assert(bplus::SimpleLessCompare<int64_t, key_compare>);
|
||||
|
||||
#include "utils/intrusive_btree.hh"
|
||||
|
||||
class perf_intrusive_key {
|
||||
|
||||
Reference in New Issue
Block a user