Sprout/libs/algorithm/test/all_of_equal.cpp

77 lines
2 KiB
C++
Raw Normal View History

#ifndef SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP
#include <sprout/algorithm/all_of_equal.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_all_of_equal_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 1, 1, 1, 10, 10, 10, 10, 10}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
sprout::begin(arr1),
sprout::end(arr1),
1
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
1
);
TESTSPR_BOTH_ASSERT(result);
}
2013-01-11 18:41:13 +00:00
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
testspr::reduct_input(sprout::begin(arr1)),
testspr::reduct_input(sprout::end(arr1)),
1
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
testspr::reduct_input(sprout::begin(arr1)),
testspr::reduct_input(sprout::begin(arr1) + 5),
1
);
TESTSPR_BOTH_ASSERT(result);
}
#if defined(__clang__)
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::end(arr1)),
1
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::begin(arr1) + 5),
1
);
TESTSPR_BOTH_ASSERT(result);
}
#endif
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_all_of_equal_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP