King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-08-03 12:49:50 +00:00
Code Issues Releases Wiki Activity

fix iterator parameter

Browse source
This commit is contained in:
bolero-MURAKAMI 2016-04-01 23:37:48 +09:00
parent 6e8b5ea395
commit 802f2fbaed
111 changed files with 607 additions and 633 deletions
Download patch file Download diff file Expand all files Collapse all files

6
sprout/detail/algorithm/count_n.hpp
View file

@ -24,7 +24,7 @@ namespace sprout {
typename std::iterator_traits<RandomAccessIterator>::difference_type
>::type
count_n(
RandomAccessIterator first, typename std::iterator_traits<RandomAccessIterator>::difference_type n, T const& value,
RandomAccessIterator const& first, typename std::iterator_traits<RandomAccessIterator>::difference_type n, T const& value,
std::random_access_iterator_tag*
)
{
@ -52,7 +52,7 @@ namespace sprout {
template<typename InputIterator, typename T>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
count_n(
InputIterator first, typename std::iterator_traits<InputIterator>::difference_type n, T const& value,
InputIterator const& first, typename std::iterator_traits<InputIterator>::difference_type n, T const& value,
std::input_iterator_tag*
)
{
@ -70,7 +70,7 @@ namespace sprout {
//
template<typename InputIterator, typename T>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
count_n(InputIterator first, typename std::iterator_traits<InputIterator>::difference_type n, T const& value) {
count_n(InputIterator const& first, typename std::iterator_traits<InputIterator>::difference_type n, T const& value) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::detail::count_n(first, n, value, category());
}

6
sprout/detail/algorithm/count_n_if.hpp
View file

@ -25,7 +25,7 @@ namespace sprout {
typename std::iterator_traits<RandomAccessIterator>::difference_type
>::type
count_n_if(
RandomAccessIterator first, typename std::iterator_traits<RandomAccessIterator>::difference_type n, Predicate pred,
RandomAccessIterator const& first, typename std::iterator_traits<RandomAccessIterator>::difference_type n, Predicate pred,
std::random_access_iterator_tag*
)
{
@ -53,7 +53,7 @@ namespace sprout {
template<typename InputIterator, typename Predicate>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
count_n_if(
InputIterator first, typename std::iterator_traits<InputIterator>::difference_type n, Predicate pred,
InputIterator const& first, typename std::iterator_traits<InputIterator>::difference_type n, Predicate pred,
std::input_iterator_tag*
)
{
@ -71,7 +71,7 @@ namespace sprout {
//
template<typename InputIterator, typename Predicate>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
count_n_if(InputIterator first, typename std::iterator_traits<InputIterator>::difference_type n, Predicate pred) {
count_n_if(InputIterator const& first, typename std::iterator_traits<InputIterator>::difference_type n, Predicate pred) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::detail::count_n_if(first, n, pred, category());

14
sprout/detail/algorithm/overlap_count.hpp
View file

@ -21,7 +21,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::iterator_traits<RandomAccessIterator>::difference_type
overlap_count_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, BinaryPredicate pred,
RandomAccessIterator const& first, RandomAccessIterator const& last, BinaryPredicate pred,
typename std::iterator_traits<RandomAccessIterator>::difference_type pivot
)
{
@ -42,7 +42,7 @@ namespace sprout {
typename std::iterator_traits<RandomAccessIterator>::difference_type
>::type
overlap_count(
RandomAccessIterator first, RandomAccessIterator last, BinaryPredicate pred,
RandomAccessIterator const& first, RandomAccessIterator const& last, BinaryPredicate pred,
std::random_access_iterator_tag*
)
{
@ -58,7 +58,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR sprout::tuples::tuple<InputIterator, typename std::iterator_traits<InputIterator>::value_type, typename std::iterator_traits<InputIterator>::difference_type>
overlap_count_impl_1(
sprout::tuples::tuple<InputIterator, typename std::iterator_traits<InputIterator>::value_type, typename std::iterator_traits<InputIterator>::difference_type> const& current,
InputIterator last, BinaryPredicate pred, typename std::iterator_traits<InputIterator>::difference_type n
InputIterator const& last, BinaryPredicate pred, typename std::iterator_traits<InputIterator>::difference_type n
)
{
typedef sprout::tuples::tuple<InputIterator, typename std::iterator_traits<InputIterator>::value_type, typename std::iterator_traits<InputIterator>::difference_type> type;
@ -80,7 +80,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR sprout::tuples::tuple<InputIterator, typename std::iterator_traits<InputIterator>::value_type, typename std::iterator_traits<InputIterator>::difference_type>
overlap_count_impl(
sprout::tuples::tuple<InputIterator, typename std::iterator_traits<InputIterator>::value_type, typename std::iterator_traits<InputIterator>::difference_type> const& current,
InputIterator last, BinaryPredicate pred, typename std::iterator_traits<InputIterator>::difference_type n
InputIterator const& last, BinaryPredicate pred, typename std::iterator_traits<InputIterator>::difference_type n
)
{
return sprout::tuples::get<0>(current) == last ? current
@ -96,7 +96,7 @@ namespace sprout {
template<typename InputIterator, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
overlap_count(
InputIterator first, InputIterator last, BinaryPredicate pred,
InputIterator const& first, InputIterator const& last, BinaryPredicate pred,
std::input_iterator_tag*
)
{
@ -116,14 +116,14 @@ namespace sprout {
//
template<typename InputIterator, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
overlap_count(InputIterator first, InputIterator last, BinaryPredicate pred) {
overlap_count(InputIterator const& first, InputIterator const& last, BinaryPredicate pred) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::detail::overlap_count(first, last, pred, category());
}
template<typename InputIterator>
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type
overlap_count(InputIterator first, InputIterator last) {
overlap_count(InputIterator const& first, InputIterator const& last) {
return sprout::detail::overlap_count(
first, last,
NS_SSCRISK_CEL_OR_SPROUT::equal_to<typename std::iterator_traits<InputIterator>::value_type>()

4
sprout/detail/str.hpp
View file

@ -14,7 +14,7 @@ namespace sprout {
namespace detail {
template<typename InputIterator>
inline SPROUT_CONSTEXPR InputIterator
str_find_check(InputIterator found) {
str_find_check(InputIterator const& found) {
return !*found ? InputIterator()
: found
;
@ -22,7 +22,7 @@ namespace sprout {
template<typename InputIterator, typename T>
inline SPROUT_CONSTEXPR InputIterator
str_find_check(InputIterator found, T const& value) {
str_find_check(InputIterator const& found, T const& value) {
return !(*found == value) && !*found ? InputIterator()
: found
;