1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-12-03 21:15:42 +00:00
Sprout/libs/algorithm/test/none_of_equal.cpp
2016-02-25 18:48:28 +09:00

129 lines
3.7 KiB
C++

/*=============================================================================
Copyright (c) 2011-2016 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef SPROUT_LIBS_ALGORITHM_TEST_NONE_OF_EQUAL_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_NONE_OF_EQUAL_CPP
#include <sprout/algorithm/none_of_equal.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_none_of_equal_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
sprout::begin(arr1),
sprout::end(arr1),
10
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
sprout::begin(arr1),
sprout::end(arr1),
11
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
11
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::end(arr1)),
10
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::end(arr1)),
11
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::begin(arr1) + 5),
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::begin(arr1) + 5),
11
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
10
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
11
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::none_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
11
);
TESTSPR_BOTH_ASSERT(result);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_none_of_equal_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_NONE_OF_EQUAL_CPP