mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2025-08-03 12:49:50 +00:00
sprout/algorithm/fixed/partition_copy.hpp 修正
sprout/algorithm/fit/partition_copy.hpp 修正
This commit is contained in:
bolero-MURAKAMI
parent
4729d31bf2
commit
068656e0b7
11 changed files with 343 additions and 248 deletions
|
|
@ -34,11 +34,11 @@ namespace sprout {
|
|||
//
|
||||
// count
|
||||
//
|
||||
template<typename Iterator, typename T>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type count(
|
||||
Iterator first,
|
||||
Iterator last,
|
||||
T const & value
|
||||
template<typename InputIterator, typename T>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type count(
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
T const& value
|
||||
)
|
||||
{
|
||||
return first == last
|
||||
|
|
@ -50,26 +50,27 @@ namespace sprout {
|
|||
//
|
||||
// count_if
|
||||
//
|
||||
template<typename Iterator, typename Predicate>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type count_if(
|
||||
Iterator first,
|
||||
Iterator last,
|
||||
template<typename InputIterator, typename Predicate>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type count_if(
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Predicate pred
|
||||
)
|
||||
{
|
||||
return first == last
|
||||
? 0
|
||||
: (pred(*first) ? 1 : 0) + sprout::detail::count_if(sprout::next(first), last, pred);
|
||||
: (pred(*first) ? 1 : 0) + sprout::detail::count_if(sprout::next(first), last, pred)
|
||||
;
|
||||
}
|
||||
|
||||
//
|
||||
// equal
|
||||
//
|
||||
template<typename Iterator1, typename Iterator2>
|
||||
template<typename InputIterator1, typename InputIterator2>
|
||||
SPROUT_CONSTEXPR bool equal(
|
||||
Iterator1 first1,
|
||||
Iterator1 last1,
|
||||
Iterator2 first2
|
||||
InputIterator1 first1,
|
||||
InputIterator1 last1,
|
||||
InputIterator2 first2
|
||||
)
|
||||
{
|
||||
return first1 == last1
|
||||
|
|
@ -77,28 +78,29 @@ namespace sprout {
|
|||
: *first1 == *first2 && sprout::detail::equal(sprout::next(first1), last1, sprout::next(first2))
|
||||
;
|
||||
}
|
||||
template<typename Iterator1, typename Iterator2, typename Predicate>
|
||||
template<typename InputIterator1, typename InputIterator2, typename Predicate>
|
||||
SPROUT_CONSTEXPR bool equal(
|
||||
Iterator1 first1,
|
||||
Iterator1 last1,
|
||||
Iterator2 first2,
|
||||
InputIterator1 first1,
|
||||
InputIterator1 last1,
|
||||
InputIterator2 first2,
|
||||
Predicate pred
|
||||
)
|
||||
{
|
||||
return first1 == last1
|
||||
? true
|
||||
: pred(*first1, *first2) && sprout::detail::equal(sprout::next(first1), last1, sprout::next(first2), pred);
|
||||
: pred(*first1, *first2) && sprout::detail::equal(sprout::next(first1), last1, sprout::next(first2), pred)
|
||||
;
|
||||
}
|
||||
|
||||
//
|
||||
// lexicographical_compare
|
||||
//
|
||||
template<typename Iterator1, typename Iterator2>
|
||||
template<typename InputIterator1, typename InputIterator2>
|
||||
SPROUT_CONSTEXPR bool lexicographical_compare(
|
||||
Iterator1 first1,
|
||||
Iterator1 last1,
|
||||
Iterator2 first2,
|
||||
Iterator2 last2
|
||||
InputIterator1 first1,
|
||||
InputIterator1 last1,
|
||||
InputIterator2 first2,
|
||||
InputIterator2 last2
|
||||
)
|
||||
{
|
||||
return first2 == last2
|
||||
|
|
@ -107,14 +109,15 @@ namespace sprout {
|
|||
? true
|
||||
: *first2 < *first1
|
||||
? false
|
||||
: sprout::detail::lexicographical_compare(sprout::next(first1), last1, sprout::next(first2), last2);
|
||||
: sprout::detail::lexicographical_compare(sprout::next(first1), last1, sprout::next(first2), last2)
|
||||
;
|
||||
}
|
||||
template<typename Iterator1, typename Iterator2, typename Compare>
|
||||
template<typename InputIterator1, typename InputIterator2, typename Compare>
|
||||
SPROUT_CONSTEXPR bool lexicographical_compare(
|
||||
Iterator1 first1,
|
||||
Iterator1 last1,
|
||||
Iterator2 first2,
|
||||
Iterator2 last2,
|
||||
InputIterator1 first1,
|
||||
InputIterator1 last1,
|
||||
InputIterator2 first2,
|
||||
InputIterator2 last2,
|
||||
Compare comp
|
||||
)
|
||||
{
|
||||
|
|
@ -124,14 +127,15 @@ namespace sprout {
|
|||
? true
|
||||
: comp(*first2, *first1)
|
||||
? false
|
||||
: sprout::detail::lexicographical_compare(sprout::next(first1), last1, sprout::next(first2), last2, comp);
|
||||
: sprout::detail::lexicographical_compare(sprout::next(first1), last1, sprout::next(first2), last2, comp)
|
||||
;
|
||||
}
|
||||
|
||||
//
|
||||
// find
|
||||
//
|
||||
template<typename Iterator, typename T>
|
||||
SPROUT_CONSTEXPR Iterator find(Iterator first, Iterator last, T const& value) {
|
||||
template<typename InputIterator, typename T>
|
||||
SPROUT_CONSTEXPR InputIterator find(InputIterator first, InputIterator last, T const& value) {
|
||||
return first == last || *first == value
|
||||
? first
|
||||
: sprout::detail::find(sprout::next(first), last, value)
|
||||
|
|
|
|||
44
sprout/detail/algorithm_ext.hpp
Normal file
44
sprout/detail/algorithm_ext.hpp
Normal file
|
|
@ -0,0 +1,44 @@
|
|||
#ifndef SPROUT_DETAIL_ALGORITHM_EXT_HPP
|
||||
#define SPROUT_DETAIL_ALGORITHM_EXT_HPP
|
||||
|
||||
#include <iterator>
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace detail {
|
||||
//
|
||||
// count_n
|
||||
//
|
||||
template<typename InputIterator, typename Size, typename T>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type count_n(
|
||||
InputIterator first,
|
||||
Size n,
|
||||
T const& value
|
||||
)
|
||||
{
|
||||
return n == 0
|
||||
? 0
|
||||
: (*first == value ? 1 : 0) + sprout::detail::count_n(sprout::next(first), n - 1, value)
|
||||
;
|
||||
}
|
||||
|
||||
//
|
||||
// count_n_if
|
||||
//
|
||||
template<typename InputIterator, typename Size, typename Predicate>
|
||||
SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::difference_type count_n_if(
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Predicate pred
|
||||
)
|
||||
{
|
||||
return n == 0
|
||||
? 0
|
||||
: (pred(*first) ? 1 : 0) + sprout::detail::count_n_if(sprout::next(first), n - 1, pred)
|
||||
;
|
||||
}
|
||||
} // namespace detail
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_DETAIL_ALGORITHM_EXT_HPP
|
||||
87
sprout/detail/container_complate.hpp
Normal file
87
sprout/detail/container_complate.hpp
Normal file
|
|
@ -0,0 +1,87 @@
|
|||
#ifndef SPROUT_DETAIL_CONTAINER_COMPLATE_HPP
|
||||
#define SPROUT_DETAIL_CONTAINER_COMPLATE_HPP
|
||||
|
||||
#include <type_traits>
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/fixed_container/traits.hpp>
|
||||
#include <sprout/fixed_container/functions.hpp>
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
#include <sprout/algorithm/fixed/result_of.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace detail {
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_2(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_2(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return container_complate_2(result, args..., *sprout::next(sprout::fixed_begin(result), sizeof...(Args)));
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_1(
|
||||
Result const& result,
|
||||
typename sprout::fixed_container_traits<Result>::difference_type remain,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_1(
|
||||
Result const& result,
|
||||
typename sprout::fixed_container_traits<Result>::difference_type remain,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return remain != 0
|
||||
? container_complate_1(result, remain - 1, *sprout::next(sprout::fixed_begin(result), remain - 1), args...)
|
||||
: container_complate_2(result, args...)
|
||||
;
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return container_complate_1(result, sprout::fixed_begin_offset(result), args...);
|
||||
}
|
||||
} // namespace detail
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_DETAIL_CONTAINER_COMPLATE_HPP
|
||||
87
sprout/detail/container_complate_backward.hpp
Normal file
87
sprout/detail/container_complate_backward.hpp
Normal file
|
|
@ -0,0 +1,87 @@
|
|||
#ifndef SPROUT_DETAIL_CONTAINER_COMPLATE_BACKWARD_HPP
|
||||
#define SPROUT_DETAIL_CONTAINER_COMPLATE_BACKWARD_HPP
|
||||
|
||||
#include <type_traits>
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/fixed_container/traits.hpp>
|
||||
#include <sprout/fixed_container/functions.hpp>
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
#include <sprout/algorithm/fixed/result_of.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace detail {
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward_2(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward_2(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return container_complate_backward_2(result, *sprout::prev(sprout::fixed_end(result), sizeof...(Args) + 1), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward_1(
|
||||
Result const& result,
|
||||
typename sprout::fixed_container_traits<Result>::difference_type remain,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward_1(
|
||||
Result const& result,
|
||||
typename sprout::fixed_container_traits<Result>::difference_type remain,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return remain != 0
|
||||
? container_complate_backward_1(result, remain - 1, args..., *sprout::prev(sprout::fixed_end(result), remain))
|
||||
: container_complate_backward_2(result, args...)
|
||||
;
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
||||
}
|
||||
template<typename Result, typename... Args>
|
||||
SPROUT_CONSTEXPR inline typename std::enable_if<
|
||||
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
||||
typename sprout::fixed::result_of::algorithm<Result>::type
|
||||
>::type container_complate_backward(
|
||||
Result const& result,
|
||||
Args const&... args
|
||||
)
|
||||
{
|
||||
return container_complate_backward_1(result, sprout::fixed_end_offset_backward(result), args...);
|
||||
}
|
||||
} // namespace detail
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_DETAIL_CONTAINER_COMPLATE_BACKWARD_HPP
|
||||
Loading…
Add table
Add a link
Reference in a new issue