mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-02-11 10:03:59 +00:00
add C++14 constexpr copy_while, copy_until, clamp_range
This commit is contained in:
parent
ac66209e24
commit
c54c980b79
4 changed files with 124 additions and 4 deletions
|
@ -59,10 +59,9 @@
|
||||||
//#include <sprout/algorithm/cxx14/next_permutation.hpp>
|
//#include <sprout/algorithm/cxx14/next_permutation.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/prev_permutation.hpp>
|
//#include <sprout/algorithm/cxx14/prev_permutation.hpp>
|
||||||
#include <sprout/algorithm/cxx14/sample.hpp>
|
#include <sprout/algorithm/cxx14/sample.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/copy_while.hpp>
|
#include <sprout/algorithm/cxx14/copy_while.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/copy_until.hpp>
|
#include <sprout/algorithm/cxx14/copy_until.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/clamp_range.hpp>
|
#include <sprout/algorithm/cxx14/clamp_range.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/clamp_range_copy.hpp>
|
|
||||||
//#include <sprout/algorithm/cxx14/bogo_sort.hpp>
|
//#include <sprout/algorithm/cxx14/bogo_sort.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/bogo_sort_result.hpp>
|
//#include <sprout/algorithm/cxx14/bogo_sort_result.hpp>
|
||||||
//#include <sprout/algorithm/cxx14/bozo_sort.hpp>
|
//#include <sprout/algorithm/cxx14/bozo_sort.hpp>
|
||||||
|
|
55
sprout/algorithm/cxx14/clamp_range.hpp
Normal file
55
sprout/algorithm/cxx14/clamp_range.hpp
Normal file
|
@ -0,0 +1,55 @@
|
||||||
|
/*=============================================================================
|
||||||
|
Copyright (c) 2011-2014 Bolero MURAKAMI
|
||||||
|
https://github.com/bolero-MURAKAMI/Sprout
|
||||||
|
|
||||||
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||||
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
=============================================================================*/
|
||||||
|
#ifndef SPROUT_ALGORITHM_CXX14_CLAMP_RANGE_HPP
|
||||||
|
#define SPROUT_ALGORITHM_CXX14_CLAMP_RANGE_HPP
|
||||||
|
|
||||||
|
#include <sprout/config.hpp>
|
||||||
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
||||||
|
#include <sprout/type_traits/enabler_if.hpp>
|
||||||
|
#include <sprout/algorithm/clamp.hpp>
|
||||||
|
|
||||||
|
namespace sprout {
|
||||||
|
//
|
||||||
|
// clamp_range
|
||||||
|
//
|
||||||
|
template<
|
||||||
|
typename InputIterator, typename OutputIterator, typename Compare,
|
||||||
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
||||||
|
>
|
||||||
|
inline SPROUT_CXX14_CONSTEXPR OutputIterator
|
||||||
|
clamp_range(
|
||||||
|
InputIterator first, InputIterator last, OutputIterator result,
|
||||||
|
typename std::iterator_traits<InputIterator>::value_type const& low,
|
||||||
|
typename std::iterator_traits<InputIterator>::value_type const& high,
|
||||||
|
Compare comp
|
||||||
|
)
|
||||||
|
{
|
||||||
|
while (first != last) {
|
||||||
|
*result++ = sprout::clamp(*first++, low, high, comp);
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
template<
|
||||||
|
typename InputIterator, typename OutputIterator,
|
||||||
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
||||||
|
>
|
||||||
|
inline SPROUT_CXX14_CONSTEXPR OutputIterator
|
||||||
|
clamp_range(
|
||||||
|
InputIterator first, InputIterator last, OutputIterator result,
|
||||||
|
typename std::iterator_traits<InputIterator>::value_type const& low,
|
||||||
|
typename std::iterator_traits<InputIterator>::value_type const& high
|
||||||
|
)
|
||||||
|
{
|
||||||
|
while (first != last) {
|
||||||
|
*result++ = sprout::clamp(*first++, low, high);
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
} // namespace sprout
|
||||||
|
|
||||||
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_CLAMP_RANGE_HPP
|
33
sprout/algorithm/cxx14/copy_until.hpp
Normal file
33
sprout/algorithm/cxx14/copy_until.hpp
Normal file
|
@ -0,0 +1,33 @@
|
||||||
|
/*=============================================================================
|
||||||
|
Copyright (c) 2011-2014 Bolero MURAKAMI
|
||||||
|
https://github.com/bolero-MURAKAMI/Sprout
|
||||||
|
|
||||||
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||||
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
=============================================================================*/
|
||||||
|
#ifndef SPROUT_ALGORITHM_CXX14_COPY_UNTIL_HPP
|
||||||
|
#define SPROUT_ALGORITHM_CXX14_COPY_UNTIL_HPP
|
||||||
|
|
||||||
|
#include <sprout/config.hpp>
|
||||||
|
#include <sprout/utility/pair/pair.hpp>
|
||||||
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
||||||
|
#include <sprout/type_traits/enabler_if.hpp>
|
||||||
|
|
||||||
|
namespace sprout {
|
||||||
|
//
|
||||||
|
// copy_until
|
||||||
|
//
|
||||||
|
template<
|
||||||
|
typename InputIterator, typename OutputIterator, typename Predicate,
|
||||||
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
||||||
|
>
|
||||||
|
inline SPROUT_CXX14_CONSTEXPR sprout::pair<InputIterator, OutputIterator>
|
||||||
|
copy_until(InputIterator first, InputIterator last, OutputIterator result, Predicate pred) {
|
||||||
|
for (; first != last && !pred(*first); ++first) {
|
||||||
|
*result++ = *first;
|
||||||
|
}
|
||||||
|
return std::make_pair(first, result);
|
||||||
|
}
|
||||||
|
} // namespace sprout
|
||||||
|
|
||||||
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_COPY_UNTIL_HPP
|
33
sprout/algorithm/cxx14/copy_while.hpp
Normal file
33
sprout/algorithm/cxx14/copy_while.hpp
Normal file
|
@ -0,0 +1,33 @@
|
||||||
|
/*=============================================================================
|
||||||
|
Copyright (c) 2011-2014 Bolero MURAKAMI
|
||||||
|
https://github.com/bolero-MURAKAMI/Sprout
|
||||||
|
|
||||||
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||||
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||||
|
=============================================================================*/
|
||||||
|
#ifndef SPROUT_ALGORITHM_CXX14_COPY_WHILE_HPP
|
||||||
|
#define SPROUT_ALGORITHM_CXX14_COPY_WHILE_HPP
|
||||||
|
|
||||||
|
#include <sprout/config.hpp>
|
||||||
|
#include <sprout/utility/pair/pair.hpp>
|
||||||
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
||||||
|
#include <sprout/type_traits/enabler_if.hpp>
|
||||||
|
|
||||||
|
namespace sprout {
|
||||||
|
//
|
||||||
|
// copy_while
|
||||||
|
//
|
||||||
|
template<
|
||||||
|
typename InputIterator, typename OutputIterator, typename Predicate,
|
||||||
|
typename sprout::enabler_if<sprout::is_iterator_outputable<OutputIterator>::value>::type = sprout::enabler
|
||||||
|
>
|
||||||
|
inline SPROUT_CXX14_CONSTEXPR sprout::pair<InputIterator, OutputIterator>
|
||||||
|
copy_while(InputIterator first, InputIterator last, OutputIterator result, Predicate pred) {
|
||||||
|
for (; first != last && pred(*first); ++first) {
|
||||||
|
*result++ = *first;
|
||||||
|
}
|
||||||
|
return std::make_pair(first, result);
|
||||||
|
}
|
||||||
|
} // namespace sprout
|
||||||
|
|
||||||
|
#endif // #ifndef SPROUT_ALGORITHM_CXX14_COPY_WHILE_HPP
|
Loading…
Add table
Reference in a new issue