catch3/src/catch2/benchmark, branch v3.7.0 Progmasoft Catch3: an independently maintained C++17 test framework with a parallel runner, property checks, snapshots and structured results. Slight improvement to computing clock resolution in benchmarking 2024-07-22T08:54:16+00:00 Martin Hořeňovský 2024-07-22T08:08:59+00:00 7af96bbb226930900b4b4902d7494c03bbba59c4 






Remove copyability from BenchmarkFunction
2024-07-22T08:54:14+00:00

Martin Hořeňovský

2024-07-22T07:50:24+00:00

22e6490325318d9a0c9820f7e1bb43c993adbbec

Technically we should be able to remove moveability as well, but
then we would need a larger surgery. This already improves the
compile times and binary sizes by a surprising amount.





Technically we should be able to remove moveability as well, but
then we would need a larger surgery. This already improves the
compile times and binary sizes by a surprising amount.







Replace last use of std::uniform_int_distribution with our own
2024-04-03T11:28:26+00:00

Martin Hořeňovský

2024-04-02T16:13:15+00:00

bff6e35e2b239217f3940ed52429f94b745adc50

Our implementation should be slightly faster, and has the
advantage of being consistent between platforms. This does not
have immediate user impact, because we currently use random_device
to generate random seed for resampling, but if we decide to change
this in the future, it is one less place to fix.





Our implementation should be slightly faster, and has the
advantage of being consistent between platforms. This does not
have immediate user impact, because we currently use random_device
to generate random seed for resampling, but if we decide to change
this in the future, it is one less place to fix.







Avoid useless FDuration cast in benchmark analysis (#2823)
2024-02-26T22:25:58+00:00

Sven

2024-02-26T22:25:58+00:00

fb51116d5b20ea3fef6c5a89267e7d91856a60cf

Co-authored-by: Sven Johannsen <s.johannsen@bretgeld-engineering.de>




Co-authored-by: Sven Johannsen <s.johannsen@bretgeld-engineering.de>






Cleanup types in resample
2024-01-14T19:59:05+00:00

Martin Hořeňovský

2024-01-14T19:59:05+00:00

a0ef2115f833ad5a79263d2b3634ffe3497d008c












Remove superfluous duration_casts from benchmarking
2023-12-21T17:40:00+00:00

Martin Hořeňovský

2023-12-21T17:40:00+00:00

64ade68ca2b20a1d4f850a92882ba7e9a31543d9












Ensure we always read 32 bit seed from std::random_device
2023-12-10T20:37:12+00:00

Martin Hořeňovský

2023-12-10T20:37:12+00:00

b7d70ddcd609a798048f055cf8f5b6803ac06e52












Remove static instance of std::random_device in Benchmark::analyse_samples
2023-12-10T20:22:43+00:00

Martin Hořeňovský

2023-12-10T20:22:43+00:00

a6f22c51699b78116cac54a4ac95bbed710efbd4












Use our PCG32 RNG instead of mt19937 in Benchmark::analyse_samples
2023-12-10T20:18:23+00:00

Martin Hořeňovský

2023-12-10T20:18:23+00:00

1887d42e3d880414a8e9c6746810a42521b0ee90












Add implementation of helpers for uniform float distribution
2023-12-10T17:44:10+00:00

Martin Hořeňovský

2023-11-19T20:00:53+00:00

d139b4ff7cd8823923e8616e8fef954e09e46322

Specifically we add
 * `gamma(a, b)`, which returns the magnitude of largest 1-ULP
   step in range [a, b].
 * `count_equidistant_float(a, b, distance)`, which returns the
   number of equi-distant floats in range [a, b].





Specifically we add
 * `gamma(a, b)`, which returns the magnitude of largest 1-ULP
   step in range [a, b].
 * `count_equidistant_float(a, b, distance)`, which returns the
   number of equi-distant floats in range [a, b].