[libcxx] r345523 - Fix mismatch between size_t and uint64_t in std::set benchmark.

[Samuel Benzaquen]

Author: sbenza
Date: Mon Oct 29 12:08:31 2018
New Revision: 345523

URL: http://llvm.org/viewvc/llvm-project?rev=345523&view=rev
Log:
Fix mismatch between size_t and uint64_t in std::set benchmark.

Modified:
    libcxx/trunk/benchmarks/ordered_set.bench.cpp

Modified: libcxx/trunk/benchmarks/ordered_set.bench.cpp
URL: http://llvm.org/viewvc/llvm-project/libcxx/trunk/benchmarks/ordered_set.bench.cpp?rev=345523&r1=345522&r2=345523&view=diff
==============================================================================
--- libcxx/trunk/benchmarks/ordered_set.bench.cpp (original)
+++ libcxx/trunk/benchmarks/ordered_set.bench.cpp Mon Oct 29 12:08:31 2018
@@ -83,12 +83,12 @@ struct Create : Base {
   using Base::Base;
 
   void run(benchmark::State& State) const {
-    std::vector<size_t> Keys(TableSize);
-    std::iota(Keys.begin(), Keys.end(), size_t{0});
+    std::vector<uint64_t> Keys(TableSize);
+    std::iota(Keys.begin(), Keys.end(), uint64_t{0});
     sortKeysBy(Keys, Access());
 
     while (State.KeepRunningBatch(TableSize * NumTables)) {
-      std::vector<std::set<size_t>> Sets(NumTables);
+      std::vector<std::set<uint64_t>> Sets(NumTables);
       for (auto K : Keys) {
         for (auto& Set : Sets) {
           benchmark::DoNotOptimize(Set.insert(K));