c5c4db4f51
-- f8fe0f483378c7520d8f8bdfabe4b20de4d96c7e by Andy Soffer <asoffer@google.com>: Ensure that Invoke can support C++17 in the sense that noexcept is part of the type. PiperOrigin-RevId: 261730155 -- bf796ab71653a80498f9374bc8c5111d065c64ba by Abseil Team <absl-team@google.com>: Fix typo in static_assert message for copy/move constructible by replacing "by" with "be". PiperOrigin-RevId: 261713992 -- 8c7c17c40d03a322f304a2fd73ed34462dbf265a by Andy Soffer <asoffer@google.com>: Add absl::is_function drop-in replacement for std::is_function. Some standard libraries incorrectly implement std::is_function in a few corner cases. In particular, libstdc++ functions marked noexcept. The trick being used here is that function types decay to pointers. After excluding cases like is_class, etc, we can distinguish function types by testing for this decay. Many thanks to ericwf@ for essentially writing this CL. PiperOrigin-RevId: 261705008 -- c5adf42d0a132c2525d17a719329eab2ffe0aa94 by Abseil Team <absl-team@google.com>: Add microbenchmark for StrSplit that uses delimiter ByAnyChar. PiperOrigin-RevId: 261424010 -- 66a342f9381ec56be2fe3aa5b3193dd3538a9740 by Andy Soffer <asoffer@google.com>: CMake support for Abseil Random This change touches almost build-related files for CMake almost exclusively. The one minor exception is random/internal/salted_seed_seq.h. The default warnings configuration for one of our CI builds requests not having named but unused parameters. The change in this file cleans up that warning. PiperOrigin-RevId: 261192369 GitOrigin-RevId: f8fe0f483378c7520d8f8bdfabe4b20de4d96c7e Change-Id: I05f662baacfe78750651535aa658f61c2327bc44
180 lines
5.7 KiB
C++
180 lines
5.7 KiB
C++
// Copyright 2018 The Abseil Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// https://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
#include "absl/strings/str_split.h"
|
|
|
|
#include <iterator>
|
|
#include <string>
|
|
#include <unordered_map>
|
|
#include <unordered_set>
|
|
#include <vector>
|
|
|
|
#include "benchmark/benchmark.h"
|
|
#include "absl/base/internal/raw_logging.h"
|
|
#include "absl/strings/string_view.h"
|
|
|
|
namespace {
|
|
|
|
std::string MakeTestString(int desired_length) {
|
|
static const int kAverageValueLen = 25;
|
|
std::string test(desired_length * kAverageValueLen, 'x');
|
|
for (int i = 1; i < test.size(); i += kAverageValueLen) {
|
|
test[i] = ';';
|
|
}
|
|
return test;
|
|
}
|
|
|
|
void BM_Split2StringView(benchmark::State& state) {
|
|
std::string test = MakeTestString(state.range(0));
|
|
for (auto _ : state) {
|
|
std::vector<absl::string_view> result = absl::StrSplit(test, ';');
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_Split2StringView, 0, 1 << 20);
|
|
|
|
static const absl::string_view kDelimiters = ";:,.";
|
|
|
|
std::string MakeMultiDelimiterTestString(int desired_length) {
|
|
static const int kAverageValueLen = 25;
|
|
std::string test(desired_length * kAverageValueLen, 'x');
|
|
for (int i = 0; i * kAverageValueLen < test.size(); ++i) {
|
|
// Cycle through a variety of delimiters.
|
|
test[i * kAverageValueLen] = kDelimiters[i % kDelimiters.size()];
|
|
}
|
|
return test;
|
|
}
|
|
|
|
// Measure StrSplit with ByAnyChar with four delimiters to choose from.
|
|
void BM_Split2StringViewByAnyChar(benchmark::State& state) {
|
|
std::string test = MakeMultiDelimiterTestString(state.range(0));
|
|
for (auto _ : state) {
|
|
std::vector<absl::string_view> result =
|
|
absl::StrSplit(test, absl::ByAnyChar(kDelimiters));
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_Split2StringViewByAnyChar, 0, 1 << 20);
|
|
|
|
void BM_Split2StringViewLifted(benchmark::State& state) {
|
|
std::string test = MakeTestString(state.range(0));
|
|
std::vector<absl::string_view> result;
|
|
for (auto _ : state) {
|
|
result = absl::StrSplit(test, ';');
|
|
}
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
BENCHMARK_RANGE(BM_Split2StringViewLifted, 0, 1 << 20);
|
|
|
|
void BM_Split2String(benchmark::State& state) {
|
|
std::string test = MakeTestString(state.range(0));
|
|
for (auto _ : state) {
|
|
std::vector<std::string> result = absl::StrSplit(test, ';');
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_Split2String, 0, 1 << 20);
|
|
|
|
// This benchmark is for comparing Split2 to Split1 (SplitStringUsing). In
|
|
// particular, this benchmark uses SkipEmpty() to match SplitStringUsing's
|
|
// behavior.
|
|
void BM_Split2SplitStringUsing(benchmark::State& state) {
|
|
std::string test = MakeTestString(state.range(0));
|
|
for (auto _ : state) {
|
|
std::vector<std::string> result =
|
|
absl::StrSplit(test, ';', absl::SkipEmpty());
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_Split2SplitStringUsing, 0, 1 << 20);
|
|
|
|
void BM_SplitStringToUnorderedSet(benchmark::State& state) {
|
|
const int len = state.range(0);
|
|
std::string test(len, 'x');
|
|
for (int i = 1; i < len; i += 2) {
|
|
test[i] = ';';
|
|
}
|
|
for (auto _ : state) {
|
|
std::unordered_set<std::string> result =
|
|
absl::StrSplit(test, ':', absl::SkipEmpty());
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_SplitStringToUnorderedSet, 0, 1 << 20);
|
|
|
|
void BM_SplitStringToUnorderedMap(benchmark::State& state) {
|
|
const int len = state.range(0);
|
|
std::string test(len, 'x');
|
|
for (int i = 1; i < len; i += 2) {
|
|
test[i] = ';';
|
|
}
|
|
for (auto _ : state) {
|
|
std::unordered_map<std::string, std::string> result =
|
|
absl::StrSplit(test, ':', absl::SkipEmpty());
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_SplitStringToUnorderedMap, 0, 1 << 20);
|
|
|
|
void BM_SplitStringAllowEmpty(benchmark::State& state) {
|
|
const int len = state.range(0);
|
|
std::string test(len, 'x');
|
|
for (int i = 1; i < len; i += 2) {
|
|
test[i] = ';';
|
|
}
|
|
for (auto _ : state) {
|
|
std::vector<std::string> result = absl::StrSplit(test, ';');
|
|
benchmark::DoNotOptimize(result);
|
|
}
|
|
}
|
|
BENCHMARK_RANGE(BM_SplitStringAllowEmpty, 0, 1 << 20);
|
|
|
|
struct OneCharLiteral {
|
|
char operator()() const { return 'X'; }
|
|
};
|
|
|
|
struct OneCharStringLiteral {
|
|
const char* operator()() const { return "X"; }
|
|
};
|
|
|
|
template <typename DelimiterFactory>
|
|
void BM_SplitStringWithOneChar(benchmark::State& state) {
|
|
const auto delimiter = DelimiterFactory()();
|
|
std::vector<absl::string_view> pieces;
|
|
size_t v = 0;
|
|
for (auto _ : state) {
|
|
pieces = absl::StrSplit("The quick brown fox jumps over the lazy dog",
|
|
delimiter);
|
|
v += pieces.size();
|
|
}
|
|
ABSL_RAW_CHECK(v == state.iterations(), "");
|
|
}
|
|
BENCHMARK_TEMPLATE(BM_SplitStringWithOneChar, OneCharLiteral);
|
|
BENCHMARK_TEMPLATE(BM_SplitStringWithOneChar, OneCharStringLiteral);
|
|
|
|
template <typename DelimiterFactory>
|
|
void BM_SplitStringWithOneCharNoVector(benchmark::State& state) {
|
|
const auto delimiter = DelimiterFactory()();
|
|
size_t v = 0;
|
|
for (auto _ : state) {
|
|
auto splitter = absl::StrSplit(
|
|
"The quick brown fox jumps over the lazy dog", delimiter);
|
|
v += std::distance(splitter.begin(), splitter.end());
|
|
}
|
|
ABSL_RAW_CHECK(v == state.iterations(), "");
|
|
}
|
|
BENCHMARK_TEMPLATE(BM_SplitStringWithOneCharNoVector, OneCharLiteral);
|
|
BENCHMARK_TEMPLATE(BM_SplitStringWithOneCharNoVector, OneCharStringLiteral);
|
|
|
|
} // namespace
|