system/serenity
system/serenity
1
0
Fork 0
mirror of https://github.com/SerenityOS/serenity synced 2024-09-06 17:06:31 +00:00
Code Issues Packages Projects Releases Wiki Activity

Tests: Benchmark DisjointChunck::is_empty

Browse source
This commit is contained in:
Michel Hermier 2021-12-23 12:38:22 +01:00 committed by Brian Gianforcaro
parent 3a177b9209
commit 44a6d7968a
1 changed files with 56 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

56
Tests/AK/TestDisjointChunks.cpp
View file

@ -80,3 +80,59 @@ TEST_CASE(spans)
EXPECT_EQ(it, cross_chunk_slice.end());
}
#define INIT_ITERATIONS (1'000'000)
#define ITERATIONS (100)
static DisjointChunks<int> basic_really_empty_chunks;
BENCHMARK_CASE(basic_really_empty)
{
DisjointChunks<int> chunks;
for (size_t i = 0; i < ITERATIONS; ++i)
EXPECT(chunks.is_empty());
}
static DisjointChunks<int> basic_really_empty_large_chunks = []() {
DisjointChunks<int> chunks;
chunks.ensure_capacity(INIT_ITERATIONS);
for (size_t i = 0; i < INIT_ITERATIONS; ++i)
chunks.append({});
return chunks;
}();
BENCHMARK_CASE(basic_really_empty_large)
{
for (size_t i = 0; i < ITERATIONS; ++i)
EXPECT(basic_really_empty_large_chunks.is_empty());
}
static DisjointChunks<int> basic_mostly_empty_chunks = []() {
DisjointChunks<int> chunks;
chunks.ensure_capacity(INIT_ITERATIONS + 1);
for (size_t i = 0; i < INIT_ITERATIONS; ++i)
chunks.append({});
chunks.append({ 1, 2, 3 });
return chunks;
}();
BENCHMARK_CASE(basic_mostly_empty)
{
for (size_t i = 0; i < ITERATIONS; ++i) {
EXPECT(!basic_mostly_empty_chunks.is_empty());
}
}
static DisjointChunks<int> basic_full_chunks = []() {
DisjointChunks<int> chunks;
chunks.ensure_capacity(INIT_ITERATIONS + 1);
for (size_t i = 0; i < INIT_ITERATIONS; ++i)
chunks.append({ 1, 2, 3 });
return chunks;
}();
BENCHMARK_CASE(basic_full)
{
for (size_t i = 0; i < ITERATIONS; ++i)
EXPECT(!basic_full_chunks.is_empty());
}