mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-05-12 09:33:30 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix implementation: search_n

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-13 18:08:59 +09:00
parent 9b0d1a7933
commit d6914ddd72
3 changed files with 124 additions and 21 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
libs/algorithm/test/non_modifying.cpp
View file

@ -22,6 +22,7 @@
#include "./equal.cpp" #include "./equal.cpp"
#include "./is_permutation.cpp" #include "./is_permutation.cpp"
#include "./search.cpp" #include "./search.cpp"
#include "./search_n.cpp"
#ifdef TESTSPR_CPP_INCLUDE_DISABLE_SPROUT_LIBS_ALGORITHM_TEST_NON_MODIFYIING_CPP #ifdef TESTSPR_CPP_INCLUDE_DISABLE_SPROUT_LIBS_ALGORITHM_TEST_NON_MODIFYIING_CPP
# undef TESTSPR_CPP_INCLUDE # undef TESTSPR_CPP_INCLUDE
@ -45,6 +46,7 @@ namespace testspr {
testspr::algorithm_equal_test(); testspr::algorithm_equal_test();
testspr::algorithm_is_permutation_test(); testspr::algorithm_is_permutation_test();
testspr::algorithm_search_test(); testspr::algorithm_search_test();
testspr::algorithm_search_n_test();
} }
} // namespace testspr } // namespace testspr

101
libs/algorithm/test/search_n.cpp Normal file
View 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

42
sprout/algorithm/search_n.hpp
View file

@ -3,33 +3,33 @@
#include <sprout/config.hpp> #include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp> #include <sprout/iterator/operation.hpp>
#include <sprout/iterator/value_iterator.hpp>
#include <sprout/functional/equal_to.hpp>
#include <sprout/algorithm/search.hpp>
namespace sprout { namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.2.13 Search // 25.2.13 Search
template<typename ForwardIterator, typename Size, typename T> //
inline SPROUT_CONSTEXPR ForwardIterator // recursion depth:
search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value) { // [first, last) is RandomAccessIterator -> O(log N)
return first == last || count == 0 ? first // otherwise -> O(N)
: sprout::next(first) == last && count > 1 ? last //
: *first == value
&& sprout::search_n(sprout::next(first), last, count - 1, value) == sprout::next(first)
? first
: sprout::search_n(sprout::next(first), last, count, value)
;
}
template<typename ForwardIterator, typename Size, typename T, typename BinaryPredicate> template<typename ForwardIterator, typename Size, typename T, typename BinaryPredicate>
inline SPROUT_CONSTEXPR ForwardIterator inline SPROUT_CONSTEXPR ForwardIterator
search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value, BinaryPredicate pred) { search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value, BinaryPredicate pred) {
return first == last || count == 0 ? first typedef sprout::value_iterator<T const&> iterator;
: sprout::next(first) == last && count > 1 ? last typedef typename iterator::difference_type difference_type;
: *first == value return sprout::search(
&& sprout::search_n(sprout::next(first), last, count - 1, value, pred) == sprout::next(first) first, last,
? first iterator(value, static_cast<difference_type>(count)), iterator(value, 0),
: sprout::search_n(sprout::next(first), last, count, value, pred) pred
; );
}
template<typename ForwardIterator, typename Size, typename T>
inline SPROUT_CONSTEXPR ForwardIterator
search_n(ForwardIterator first, ForwardIterator last, Size count, T const& value) {
return sprout::search_n(first, last, count, value, sprout::equal_to<>());
} }
} // namespace sprout } // namespace sprout