mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-04 14:14:09 +00:00
fix implementation: search_n
This commit is contained in:
parent
9b0d1a7933
commit
d6914ddd72
3 changed files with 124 additions and 21 deletions
|
@ -22,6 +22,7 @@
|
|||
#include "./equal.cpp"
|
||||
#include "./is_permutation.cpp"
|
||||
#include "./search.cpp"
|
||||
#include "./search_n.cpp"
|
||||
|
||||
#ifdef TESTSPR_CPP_INCLUDE_DISABLE_SPROUT_LIBS_ALGORITHM_TEST_NON_MODIFYIING_CPP
|
||||
# undef TESTSPR_CPP_INCLUDE
|
||||
|
@ -45,6 +46,7 @@ namespace testspr {
|
|||
testspr::algorithm_equal_test();
|
||||
testspr::algorithm_is_permutation_test();
|
||||
testspr::algorithm_search_test();
|
||||
testspr::algorithm_search_n_test();
|
||||
}
|
||||
} // namespace testspr
|
||||
|
||||
|
|
101
libs/algorithm/test/search_n.cpp
Normal file
101
libs/algorithm/test/search_n.cpp
Normal file
|
@ -0,0 +1,101 @@
|
|||
#ifndef SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP
|
||||
#define SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP
|
||||
|
||||
#include <sprout/algorithm/search_n.hpp>
|
||||
#include <sprout/array.hpp>
|
||||
#include <sprout/container.hpp>
|
||||
#include <testspr/tools.hpp>
|
||||
|
||||
namespace testspr {
|
||||
static void algorithm_search_n_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 found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
2,
|
||||
5
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
4,
|
||||
5
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
2,
|
||||
5
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
4,
|
||||
5
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
||||
}
|
||||
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
2,
|
||||
5,
|
||||
testspr::equal_to<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
4,
|
||||
5,
|
||||
testspr::equal_to<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
2,
|
||||
5,
|
||||
testspr::equal_to<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
4,
|
||||
5,
|
||||
testspr::equal_to<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
||||
}
|
||||
}
|
||||
}
|
||||
} // namespace testspr
|
||||
|
||||
#ifndef TESTSPR_CPP_INCLUDE
|
||||
# define TESTSPR_TEST_FUNCTION testspr::algorithm_search_n_test
|
||||
# include <testspr/include_main.hpp>
|
||||
#endif
|
||||
|
||||
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP
|
Loading…
Add table
Add a link
Reference in a new issue