Optimizing for performance is one of the major challenges for
Phobos and user libraries in the next month and years. As an
example of the benefits, have a look at the recent blog post
about find [1].
Robert burner Schadek has proposed
std.experimental.randomized_unittest_benchmark over a year ago.
This addition tries to tackle two common use cases:
1) Automatically generating test data for algorithms
2) Evaluating the performance of algorithms (aka benchmarking)
The high level idea is to semi-_automatically_ generate
benchmarks for much more methods than find which allows to check
for regressions, find outliers and compare the performance to
other libraries.
As the PR has been pending for so long, it would be quite helpful
if you could take a look at the proposed addition, test it and
give your feedback and comments.
Github PR: https://github.com/dlang/phobos/pull/2995
Dub: https://code.dlang.org/packages/std_benchmark
I will handle the review management.
[1]
https://dlang.org/blog/index.php/2016/06/16/find-was-too-damn-slow-so-we-fixed-it/
