mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-12-03 21:15:42 +00:00
57 lines
1.6 KiB
C++
57 lines
1.6 KiB
C++
|
#ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_IF_NOT_CPP
|
||
|
#define SPROUT_LIBS_ALGORITHM_TEST_FIND_IF_NOT_CPP
|
||
|
|
||
|
#include <sprout/algorithm/find_if_not.hpp>
|
||
|
#include <sprout/array.hpp>
|
||
|
#include <sprout/container.hpp>
|
||
|
#include <testspr/tools.hpp>
|
||
|
|
||
|
namespace testspr {
|
||
|
static void algorithm_find_if_not_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 found = sprout::find_if_not(
|
||
|
sprout::begin(arr1),
|
||
|
sprout::end(arr1),
|
||
|
testspr::less_than<int>(8)
|
||
|
);
|
||
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
|
||
|
}
|
||
|
{
|
||
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_if_not(
|
||
|
sprout::begin(arr1),
|
||
|
sprout::end(arr1),
|
||
|
testspr::less_than<int>(11)
|
||
|
);
|
||
|
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
|
||
|
}
|
||
|
{
|
||
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_if_not(
|
||
|
sprout::begin(arr1),
|
||
|
sprout::begin(arr1) + 5,
|
||
|
testspr::less_than<int>(8)
|
||
|
);
|
||
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
||
|
}
|
||
|
{
|
||
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_if_not(
|
||
|
sprout::begin(arr1),
|
||
|
sprout::begin(arr1) + 5,
|
||
|
testspr::less_than<int>(11)
|
||
|
);
|
||
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
} // namespace testspr
|
||
|
|
||
|
#ifndef TESTSPR_CPP_INCLUDE
|
||
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_find_if_not_test
|
||
|
# include <testspr/include_main.hpp>
|
||
|
#endif
|
||
|
|
||
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_IF_NOT_CPP
|