analyze_bench.cpp

Go to the documentation of this file.

/** \file analyze_bench.cpp
 *  \copyright GPLv3
 *  \details Benchmark for string algorithms
 *  \author jingkaimori
 *  \date   2024
 */
 
#include "analyze.hpp"
#include "sys_utils.hpp"
#include <nanobench.h>
 
void
bench_string_join (string base_name, array<string> str) {
  ankerl::nanobench::Bench bench;
  bench.relative (true).minEpochIterations (1000).run (
      c_string (base_name * " by append"), [&] {
        string res;
        int    lth= N (str);
        for (size_t i= 0; i < lth; i++) {
          res << str[i];
        }
      });
  bench.run (c_string (base_name * " by concat"), [&] {
    string res;
    int    lth= N (str);
    for (size_t i= 0; i < lth; i++) {
      res= str[i] * res;
    }
  });
  bench.run (c_string (base_name * " by recompose"),
             [&] { recompose (str, ""); });
}
 
int
main () {
  lolly::init_tbox ();
  bench_string_join ("join regular string",
                     array<string> ("long string", "short", "", "<#ABCD>"));
  bench_string_join ("join two string", array<string> ("long string", "short"));
  bench_string_join ("join empty ones", array<string> (5));
 
  ankerl::nanobench::Rng rng;
  int                    total= 20;
  array<string>          test_case;
  for (int i= 0; i < total; i++) {
    test_case << string ('!' + i, rng.bounded (30));
  }
  bench_string_join ("join a bunch of random string", test_case);
 
  return 0;
}