[PATCH] D52697: Bug 39129: Speeding up partition_point/lower_bound/upper_bound/ by using unsigned division by 2 when possible.

[Denis Yaroshevskiy via Phabricator]

dyaroshev added inline comments.


================
Comment at: benchmarks/ordered_set.bench.cpp:86
   void run(benchmark::State& State) const {
-    std::vector<size_t> Keys(TableSize);
+    std::vector<uint64_t> Keys(TableSize);
     std::iota(Keys.begin(), Keys.end(), size_t{0});
----------------
Had a compilation error here:

/space/llvm/llvm/projects/libcxx/benchmarks/ordered_set.bench.cpp:37:6: note: candidate function not viable: no known conversion from

'std::vector<size_t>' (aka 'vector<unsigned long>') to 'std::vector<uint64_t> &' (aka 'vector<unsigned long long> &') for 1st argument


https://reviews.llvm.org/D52697