-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvalid_anagram_benchmark.cpp
48 lines (34 loc) · 1.14 KB
/
valid_anagram_benchmark.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// Copyright (c) Omar Boukli-Hacene. All rights reserved.
// Distributed under an MIT-style license that can be
// found in the LICENSE file.
// SPDX-License-Identifier: MIT
#include <string_view>
#include <catch2/catch_test_macros.hpp>
#include <nanobench.h>
#include <nameof.hpp>
#include "forfun/valid_anagram.hpp"
TEST_CASE("Valid anagram benchmarking", "[benchmark][valid_anagram]")
{
using namespace forfun::valid_anagram;
using std::string_view_literals::operator""sv;
ankerl::nanobench::Bench()
.title("Valid anagram")
.relative(true)
.run(
NAMEOF_RAW(char_only::is_anagram).c_str(),
[]() noexcept {
bool const r{char_only::is_anagram("anagram"sv, "nagaram"sv)};
ankerl::nanobench::doNotOptimizeAway(r);
}
)
.run(
NAMEOF_RAW(generic::is_anagram<char>).c_str(),
[]() noexcept(false) {
bool const r{
generic::is_anagram<char>("anagram"sv, "nagaram"sv)
};
ankerl::nanobench::doNotOptimizeAway(r);
}
)
;
}