Function BM_STR_timSort

bolt/exec/benchmarks/RowContainerSortBenchmark.cpp:204–227

}

void BM_STR_timSort(uint32_t iterations) {
  folly::BenchmarkSuspender suspender;
  auto pool = memory::memoryManager()->addLeafPool();
  VectorMaker vectorMaker(pool.get());
  auto data = getDataFromFile();
  auto vector =
      vectorMaker.encodedVector<StringView>(VectorEncoding::Simple::FLAT, data);
  DecodedVector decoded(*vector);
  // Create row container.
  std::vector<TypePtr> types{vector->type()};
  // Store the vector in the rowContainer.
  auto rowContainer =
      std::make_unique<bolt::exec::RowContainer>(types, pool.get());
  int size = vector->size();
  auto rows = store(*rowContainer, decoded, size);
  for (size_t k = 0; k < iterations; ++k) {
    suspender.dismiss();
    gfx::timsort(
        rows.begin(), rows.end(), [&](const char* left, const char* right) {
          return rowContainer->compareRows(left, right) < 0;
        });
    suspender.rehire();
  }
}
} // namespace

BENCHMARK_NAMED_PARAM(BM_Int64_stdSort, 100k_uni_noseq, 100000);