#include #include #include #include "../src/benchmark_register.h" #include "gmock/gmock.h" #include "gtest/gtest.h" namespace benchmark { namespace internal { extern std::map* global_context; namespace { TEST(AddRangeTest, Simple) { std::vector dst; AddRange(&dst, 1, 2, 2); EXPECT_THAT(dst, testing::ElementsAre(1, 2)); } TEST(AddRangeTest, Simple64) { std::vector dst; AddRange(&dst, static_cast(1), static_cast(2), 2); EXPECT_THAT(dst, testing::ElementsAre(1, 2)); } TEST(AddRangeTest, Advanced) { std::vector dst; AddRange(&dst, 5, 15, 2); EXPECT_THAT(dst, testing::ElementsAre(5, 8, 15)); } TEST(AddRangeTest, Advanced64) { std::vector dst; AddRange(&dst, static_cast(5), static_cast(15), 2); EXPECT_THAT(dst, testing::ElementsAre(5, 8, 15)); } TEST(AddRangeTest, FullRange8) { std::vector dst; AddRange(&dst, int8_t{1}, std::numeric_limits::max(), 8); EXPECT_THAT(dst, testing::ElementsAre(1, 8, 64, 127)); } TEST(AddRangeTest, FullRange64) { std::vector dst; AddRange(&dst, int64_t{1}, std::numeric_limits::max(), 1024); EXPECT_THAT( dst, testing::ElementsAre(1LL, 1024LL, 1048576LL, 1073741824LL, 1099511627776LL, 1125899906842624LL, 1152921504606846976LL, 9223372036854775807LL)); } TEST(AddRangeTest, NegativeRanges) { std::vector dst; AddRange(&dst, -8, 0, 2); EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1, 0)); } TEST(AddRangeTest, StrictlyNegative) { std::vector dst; AddRange(&dst, -8, -1, 2); EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1)); } TEST(AddRangeTest, SymmetricNegativeRanges) { std::vector dst; AddRange(&dst, -8, 8, 2); EXPECT_THAT(dst, testing::ElementsAre(-8, -4, -2, -1, 0, 1, 2, 4, 8)); } TEST(AddRangeTest, SymmetricNegativeRangesOddMult) { std::vector dst; AddRange(&dst, -30, 32, 5); EXPECT_THAT(dst, testing::ElementsAre(-30, -25, -5, -1, 0, 1, 5, 25, 32)); } TEST(AddRangeTest, NegativeRangesAsymmetric) { std::vector dst; AddRange(&dst, -3, 5, 2); EXPECT_THAT(dst, testing::ElementsAre(-3, -2, -1, 0, 1, 2, 4, 5)); } TEST(AddRangeTest, NegativeRangesLargeStep) { // Always include -1, 0, 1 when crossing zero. std::vector dst; AddRange(&dst, -8, 8, 10); EXPECT_THAT(dst, testing::ElementsAre(-8, -1, 0, 1, 8)); } TEST(AddRangeTest, ZeroOnlyRange) { std::vector dst; AddRange(&dst, 0, 0, 2); EXPECT_THAT(dst, testing::ElementsAre(0)); } TEST(AddRangeTest, ZeroStartingRange) { std::vector dst; AddRange(&dst, 0, 2, 2); EXPECT_THAT(dst, testing::ElementsAre(0, 1, 2)); } TEST(AddRangeTest, NegativeRange64) { std::vector dst; AddRange(&dst, -4, 4, 2); EXPECT_THAT(dst, testing::ElementsAre(-4, -2, -1, 0, 1, 2, 4)); } TEST(AddRangeTest, NegativeRangePreservesExistingOrder) { // If elements already exist in the range, ensure we don't change // their ordering by adding negative values. std::vector dst = {1, 2, 3}; AddRange(&dst, -2, 2, 2); EXPECT_THAT(dst, testing::ElementsAre(1, 2, 3, -2, -1, 0, 1, 2)); } TEST(AddRangeTest, FullNegativeRange64) { std::vector dst; const auto min = std::numeric_limits::min(); const auto max = std::numeric_limits::max(); AddRange(&dst, min, max, 1024); EXPECT_THAT( dst, testing::ElementsAreArray(std::vector{ min, -1152921504606846976LL, -1125899906842624LL, -1099511627776LL, -1073741824LL, -1048576LL, -1024LL, -1LL, 0LL, 1LL, 1024LL, 1048576LL, 1073741824LL, 1099511627776LL, 1125899906842624LL, 1152921504606846976LL, max})); } TEST(AddRangeTest, Simple8) { std::vector dst; AddRange(&dst, 1, 8, 2); EXPECT_THAT(dst, testing::ElementsAre(1, 2, 4, 8)); } TEST(AddCustomContext, Simple) { EXPECT_THAT(global_context, nullptr); AddCustomContext("foo", "bar"); AddCustomContext("baz", "qux"); EXPECT_THAT(*global_context, testing::UnorderedElementsAre(testing::Pair("foo", "bar"), testing::Pair("baz", "qux"))); delete global_context; global_context = nullptr; } TEST(AddCustomContext, DuplicateKey) { EXPECT_THAT(global_context, nullptr); AddCustomContext("foo", "bar"); AddCustomContext("foo", "qux"); EXPECT_THAT(*global_context, testing::UnorderedElementsAre(testing::Pair("foo", "bar"))); delete global_context; global_context = nullptr; } } // namespace } // namespace internal } // namespace benchmark