mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-02-11 10:03:59 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add c++14 constexpr version: fill, fill_n

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-10-16 13:04:49 +09:00
parent 3f85600f53
commit 7b11799ace
11 changed files with 152 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
sprout/algorithm/fill.hpp
View file

@ -9,6 +9,20 @@
#define SPROUT_ALGORITHM_FILL_HPP
#include <sprout/config.hpp>
namespace sprout {
//
// 25.3.6 Fill
//
template<typename ForwrdIterator, typename T>
inline SPROUT_CXX14_CONSTEXPR void
fill(ForwrdIterator first, ForwrdIterator last, T const& value) {
while (first != last) {
*first++ = value;
}
}
} // namespace sprout
#include <sprout/algorithm/fixed/fill.hpp>
#include <sprout/algorithm/fit/fill.hpp>

20
sprout/algorithm/fill_n.hpp
View file

@ -9,6 +9,26 @@
#define SPROUT_ALGORITHM_FILL_N_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
namespace sprout {
//
// 25.3.6 Fill
//
template<
typename OutputIterator, typename Size, typename T,
typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
>
inline SPROUT_CXX14_CONSTEXPR OutputIterator
fill_n(OutputIterator first, Size n, T const& value) {
while (n-- > 0) {
*first++ = value;
}
return first;
}
} // namespace sprout
#include <sprout/algorithm/fixed/fill_n.hpp>
#include <sprout/algorithm/fit/fill_n.hpp>

4
sprout/algorithm/fit/replace_copy_if.hpp
View file

@ -21,7 +21,7 @@
namespace sprout {
namespace fit {
namespace detail {
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
replace_copy_if_impl(
InputIterator first, InputIterator last, Result const& result, Predicate pred, T const& new_value,
@ -38,7 +38,7 @@ namespace sprout {
//
// replace_copy_if
//
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
replace_copy_if(InputIterator first, InputIterator last, Result const& result, Predicate pred, T const& new_value) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");

4
sprout/algorithm/fit/replace_if.hpp
View file

@ -19,7 +19,7 @@
namespace sprout {
namespace fit {
namespace detail {
template<typename Container, typename T, typename Predicate>
template<typename Container, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
replace_if_impl(
Container const& cont, Predicate pred, T const& new_value,
@ -36,7 +36,7 @@ namespace sprout {
//
// replace_if
//
template<typename Container, typename T, typename Predicate>
template<typename Container, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
replace_if(Container const& cont, Predicate pred, T const& new_value) {
return sprout::fit::detail::replace_if_impl(cont, pred, new_value, sprout::internal_begin_offset(cont));

17
sprout/algorithm/fixed/fill_n.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/value_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/fill.hpp>
#include <sprout/pit/pit.hpp>
@ -64,7 +66,20 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::fill_n;
template<
typename Container, typename Size, typename T,
typename sprout::enabler_if<!sprout::is_output_iterator<Container>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
fill_n(Container const& cont, Size n, T const& value) {
return sprout::fixed::fill_n(cont, n, value);
}
template<typename Container, typename Size, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
fill_n(Size n, T const& value) {
return sprout::fixed::fill_n<Container>(n, value);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_FILL_N_HPP

17
sprout/algorithm/fixed/replace_copy.hpp
View file

@ -17,6 +17,8 @@
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/replace_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/pit/pit.hpp>
#include <sprout/detail/container_complate.hpp>
@ -146,7 +148,20 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::replace_copy;
template<
typename InputIterator, typename Result, typename T,
typename sprout::enabler_if<!sprout::is_output_iterator<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(InputIterator first, InputIterator last, Result const& result, T const& old_value, T const& new_value) {
return sprout::fixed::replace_copy(first, last, result, old_value, new_value);
}
template<typename Result, typename InputIterator, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(InputIterator first, InputIterator last, T const& old_value, T const& new_value) {
return sprout::fixed::replace_copy<Result>(first, last, old_value, new_value);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_REPLACE_COPY_HPP

35
sprout/algorithm/fixed/replace_copy_if.hpp
View file

@ -17,6 +17,8 @@
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/replace_if_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/pit/pit.hpp>
#include <sprout/detail/container_complate.hpp>
@ -24,7 +26,7 @@
namespace sprout {
namespace fixed {
namespace detail {
template<typename RandomAccessIterator, typename Result, typename T, typename Predicate, sprout::index_t... Indexes>
template<typename RandomAccessIterator, typename Result, typename Predicate, typename T, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if_impl_ra(
RandomAccessIterator first, RandomAccessIterator,
@ -43,7 +45,7 @@ namespace sprout {
)...
);
}
template<typename RandomAccessIterator, typename Result, typename T, typename Predicate>
template<typename RandomAccessIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(
RandomAccessIterator first, RandomAccessIterator last,
@ -60,7 +62,7 @@ namespace sprout {
sprout::distance(first, last)
);
}
template<typename InputIterator, typename Result, typename T, typename Predicate, typename... Args>
template<typename InputIterator, typename Result, typename Predicate, typename T, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
@ -74,7 +76,7 @@ namespace sprout {
{
return sprout::remake<Result>(result, sprout::size(result), args...);
}
template<typename InputIterator, typename Result, typename T, typename Predicate, typename... Args>
template<typename InputIterator, typename Result, typename Predicate, typename T, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
@ -95,7 +97,7 @@ namespace sprout {
: sprout::detail::container_complate(result, args...)
;
}
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(
InputIterator first, InputIterator last,
@ -106,7 +108,7 @@ namespace sprout {
return sprout::fixed::detail::replace_copy_if_impl(first, last, result, pred, new_value, sprout::size(result));
}
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
@ -116,7 +118,7 @@ namespace sprout {
return sprout::fixed::detail::replace_copy_if(first, last, result, pred, new_value, category());
}
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
@ -132,20 +134,33 @@ namespace sprout {
//
// replace_copy_if
//
template<typename InputIterator, typename Result, typename T, typename Predicate>
template<typename InputIterator, typename Result, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(InputIterator first, InputIterator last, Result const& result, Predicate pred, T const& new_value) {
return sprout::fixed::detail::replace_copy_if(first, last, result, pred, new_value);
}
template<typename Result, typename InputIterator, typename T, typename Predicate>
template<typename Result, typename InputIterator, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(InputIterator first, InputIterator last, Predicate pred, T const& new_value) {
return sprout::fixed::replace_copy_if(first, last, sprout::pit<Result>(), pred, new_value);
}
} // namespace fixed
using sprout::fixed::replace_copy_if;
template<
typename InputIterator, typename Result, typename Predicate, typename T,
typename sprout::enabler_if<!sprout::is_output_iterator<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(InputIterator first, InputIterator last, Result const& result, Predicate pred, T const& new_value) {
return sprout::fixed::replace_copy_if(first, last, result, pred, new_value);
}
template<typename Result, typename InputIterator, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if(InputIterator first, InputIterator last, Predicate pred, T const& new_value) {
return sprout::fixed::replace_copy_if<Result>(first, last, pred, new_value);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_REPLACE_COPY_IF_HPP

2
sprout/algorithm/fixed/replace_if.hpp
View file

@ -18,7 +18,7 @@ namespace sprout {
//
// replace_if
//
template<typename Container, typename T, typename Predicate>
template<typename Container, typename Predicate, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
replace_if(Container const& cont, Predicate pred, T const& new_value) {
return sprout::fixed::replace_copy_if(sprout::begin(cont), sprout::end(cont), cont, pred, new_value);

20
sprout/algorithm/replace_copy.hpp
View file

@ -9,6 +9,26 @@
#define SPROUT_ALGORITHM_REPLACE_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
namespace sprout {
//
// 25.3.5 Replace
//
template<
typename InputIterator, typename OutputIterator, typename T,
typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
>
inline SPROUT_CXX14_CONSTEXPR void
replace_copy(InputIterator first, InputIterator last, OutputIterator result, T const& old_value, T const& new_value) {
for (; first != last; ++first) {
*result++ = (*first == old_value ? new_value : *first);
}
return result;
}
} // namespace sprout
#include <sprout/algorithm/fixed/replace_copy.hpp>
#include <sprout/algorithm/fit/replace_copy.hpp>

20
sprout/algorithm/replace_copy_if.hpp
View file

@ -9,6 +9,26 @@
#define SPROUT_ALGORITHM_REPLACE_COPY_IF_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
namespace sprout {
//
// 25.3.5 Replace
//
template<
typename InputIterator, typename OutputIterator, typename Predicate, typename T,
typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
>
inline SPROUT_CXX14_CONSTEXPR void
replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, T const& new_value) {
for (; first != last; ++first) {
*result++ = (pred(*first) ? new_value : *first);
}
return result;
}
} // namespace sprout
#include <sprout/algorithm/fixed/replace_copy_if.hpp>
#include <sprout/algorithm/fit/replace_copy_if.hpp>

16
sprout/algorithm/replace_if.hpp
View file

@ -9,6 +9,22 @@
#define SPROUT_ALGORITHM_REPLACE_IF_HPP
#include <sprout/config.hpp>
namespace sprout {
//
// 25.3.5 Replace
//
template<typename ForwrdIterator, typename Predicate, typename T>
inline SPROUT_CXX14_CONSTEXPR void
replace_if(ForwrdIterator first, ForwrdIterator last, Predicate pred, T const& new_value) {
for (; first != last; ++first) {
if (pred(*first)) {
*first = new_value;
}
}
}
} // namespace sprout
#include <sprout/algorithm/fixed/replace_if.hpp>
#include <sprout/algorithm/fit/replace_if.hpp>