[all-commits] [llvm/llvm-project] 842136: Modifications to the algorithm sort benchmark

[minjaehwang via All-commits]

  Branch: refs/heads/master
  Home:   https://github.com/llvm/llvm-project
  Commit: 8421364282646f5f398d76ffce13a37fe541f015
      https://github.com/llvm/llvm-project/commit/8421364282646f5f398d76ffce13a37fe541f015
  Author: MinJae Hwang <minjaehwang at google.com>
  Date:   2020-07-06 (Mon, 06 Jul 2020)

  Changed paths:
    M libcxx/benchmarks/algorithms.bench.cpp

  Log Message:
  -----------
  Modifications to the algorithm sort benchmark

Summary:
Modifies the algorithm sort bench:
- shows sorting time per element, instead of sorting time per array.
This would make comparison between different sizes of arrays easier.
- adds std::pair benchmark cases.
- uses a large number of arrays to benchmark, instead of repeatedly sorting the same array.
* sorting the same array again and again would not show actual sorting performance over randomized data sets.

Reviewers: EricWF, #libc, mvels

Reviewed By: EricWF, #libc, mvels

Subscribers: mgrang, libcxx-commits

Tags: #libc

Differential Revision: https://reviews.llvm.org/D81770