mirror of
https://github.com/fmtlib/fmt.git
synced 2024-11-19 11:14:41 +00:00
5e7ab2f4ea
The new code does not rely on globally defined include directories anymore. Additionally a lot of conditional code and has been removed which improves readability a lot.
116 lines
3.4 KiB
C++
116 lines
3.4 KiB
C++
/*
|
|
Tests of variadic function emulation macros.
|
|
|
|
Copyright (c) 2012-2014, Victor Zverovich
|
|
All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
1. Redistributions of source code must retain the above copyright notice, this
|
|
list of conditions and the following disclaimer.
|
|
2. Redistributions in binary form must reproduce the above copyright notice,
|
|
this list of conditions and the following disclaimer in the documentation
|
|
and/or other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
|
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <utility>
|
|
#include <gtest/gtest.h>
|
|
|
|
#define FMT_USE_VARIADIC_TEMPLATES 0
|
|
#include <cppformat/format.h>
|
|
|
|
#define IDENTITY(x) x
|
|
|
|
TEST(UtilTest, Gen) {
|
|
int values[] = {FMT_GEN(10, IDENTITY)};
|
|
for (int i = 0; i < 10; ++i)
|
|
EXPECT_EQ(i, values[i]);
|
|
}
|
|
|
|
#define MAKE_PAIR(x, y) std::make_pair(x, y)
|
|
|
|
TEST(UtilTest, ForEach) {
|
|
std::pair<char, int> values[] = {
|
|
FMT_FOR_EACH10(MAKE_PAIR, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j')
|
|
};
|
|
for (int i = 0; i < 10; ++i) {
|
|
EXPECT_EQ('a' + i, values[i].first);
|
|
EXPECT_EQ(i, values[i].second);
|
|
}
|
|
}
|
|
|
|
TEST(UtilTest, NArg) {
|
|
EXPECT_EQ(1, FMT_NARG(a));
|
|
EXPECT_EQ(2, FMT_NARG(a, b));
|
|
EXPECT_EQ(3, FMT_NARG(a, b, c));
|
|
EXPECT_EQ(4, FMT_NARG(a, b, c, d));
|
|
EXPECT_EQ(5, FMT_NARG(a, b, c, d, e));
|
|
EXPECT_EQ(6, FMT_NARG(a, b, c, d, e, f));
|
|
EXPECT_EQ(7, FMT_NARG(a, b, c, d, e, f, g));
|
|
EXPECT_EQ(8, FMT_NARG(a, b, c, d, e, f, g, h));
|
|
EXPECT_EQ(9, FMT_NARG(a, b, c, d, e, f, g, h, i));
|
|
EXPECT_EQ(10, FMT_NARG(a, b, c, d, e, f, g, h, i, j));
|
|
}
|
|
|
|
int result;
|
|
|
|
#define MAKE_TEST(func) \
|
|
void func(const char *format, const fmt::ArgList &args) { \
|
|
result = 0; \
|
|
for (unsigned i = 0; args[i].type; ++i) \
|
|
result += args[i].int_value; \
|
|
}
|
|
|
|
MAKE_TEST(test_func)
|
|
|
|
typedef char Char;
|
|
FMT_WRAP1(test_func, const char *, 1)
|
|
|
|
TEST(UtilTest, Wrap1) {
|
|
result = 0;
|
|
test_func("", 42);
|
|
EXPECT_EQ(42, result);
|
|
}
|
|
|
|
MAKE_TEST(test_variadic_void)
|
|
FMT_VARIADIC_VOID(test_variadic_void, const char *)
|
|
|
|
TEST(UtilTest, VariadicVoid) {
|
|
result = 0;
|
|
test_variadic_void("", 10, 20, 30, 40, 50, 60, 70, 80, 90, 100);
|
|
EXPECT_EQ(550, result);
|
|
}
|
|
|
|
template <int>
|
|
struct S {};
|
|
|
|
#define GET_TYPE(n) S<n>
|
|
|
|
int test_variadic(FMT_GEN(10, GET_TYPE), const fmt::ArgList &args) { \
|
|
int result = 0; \
|
|
for (unsigned i = 0; args[i].type; ++i) \
|
|
result += args[i].int_value; \
|
|
return result;
|
|
}
|
|
FMT_VARIADIC(int, test_variadic,
|
|
S<0>, S<1>, S<2>, S<3>, S<4>, S<5>, S<6>, S<7>, S<8>, S<9>)
|
|
|
|
#define MAKE_ARG(n) S<n>()
|
|
|
|
TEST(UtilTest, Variadic) {
|
|
EXPECT_EQ(550, test_variadic(FMT_GEN(10, MAKE_ARG),
|
|
10, 20, 30, 40, 50, 60, 70, 80, 90, 100));
|
|
}
|