Sprout/libs/algorithm/test/one_of_equal.cpp

130 lines
3.6 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2017 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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_ONE_OF_EQUAL_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_ONE_OF_EQUAL_CPP
#include <sprout/algorithm/one_of_equal.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_one_of_equal_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 5, 5, 5, 5, 10}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
sprout::begin(arr1),
sprout::end(arr1),
5
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
sprout::begin(arr1),
sprout::end(arr1),
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
5
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
10
);
TESTSPR_BOTH_ASSERT(!result);
}
2013-01-11 18:41:13 +00:00
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::end(arr1)),
2013-01-11 18:41:13 +00:00
5
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::end(arr1)),
2013-01-11 18:41:13 +00:00
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::begin(arr1) + 5),
2013-01-11 18:41:13 +00:00
5
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_input(sprout::begin(arr1)),
testspr::reduce_input(sprout::begin(arr1) + 5),
2013-01-11 18:41:13 +00:00
10
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
2013-01-11 18:41:13 +00:00
5
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
2013-01-11 18:41:13 +00:00
10
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
2013-01-11 18:41:13 +00:00
5
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::one_of_equal(
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
2013-01-11 18:41:13 +00:00
10
);
TESTSPR_BOTH_ASSERT(!result);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_one_of_equal_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_ONE_OF_EQUAL_CPP