mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-18 15:24:11 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix recursion depth: count, count_if, mismatch, equal, is_permutation

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-12 01:47:14 +09:00
parent b5bdde21c4
commit 75228465fe
14 changed files with 716 additions and 87 deletions
Download patch file Download diff file Expand all files Collapse all files

56
libs/algorithm/test/count.cpp Normal file
View file

@ -0,0 +1,56 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_COUNT_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_COUNT_CPP
#include <sprout/algorithm/count.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_count_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 5, 5, 5, 5, 8, 9, 10}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::count(
sprout::begin(arr1),
sprout::end(arr1),
5
);
TESTSPR_BOTH_ASSERT(result == 4);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::count(
sprout::begin(arr1),
sprout::end(arr1),
11
);
TESTSPR_BOTH_ASSERT(result == 0);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::count(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
5
);
TESTSPR_BOTH_ASSERT(result == 2);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::count(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
11
);
TESTSPR_BOTH_ASSERT(result == 0);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_count_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_COUNT_CPP