King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-02-04 21:33:56 +00:00
Code Issues Releases Wiki Activity

fix fixed algorithms

Browse source
This commit is contained in:
bolero-MURAKAMI 2014-04-05 23:31:36 +09:00
parent 57d4e78d54
commit 27f9f47027
9 changed files with 340 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

52
sprout/algorithm/fixed/clamp_range_copy.hpp
View file

@ -17,6 +17,8 @@
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/clamp_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/algorithm/clamp.hpp>
#include <sprout/pit/pit.hpp>
@ -205,7 +207,55 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::clamp_range_copy;
template<
typename InputIterator, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
clamp_range_copy(
InputIterator first, InputIterator last, Result const& result,
typename std::iterator_traits<InputIterator>::value_type const& low,
typename std::iterator_traits<InputIterator>::value_type const& high,
Compare comp
)
{
return sprout::fixed::clamp_range_copy(first, last, result, low, high, comp);
}
template<
typename InputIterator, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
clamp_range_copy(
InputIterator first, InputIterator last, Result const& result,
typename std::iterator_traits<InputIterator>::value_type const& low,
typename std::iterator_traits<InputIterator>::value_type const& high
)
{
return sprout::fixed::clamp_range_copy(first, last, result, low, high);
}
template<typename Result, typename InputIterator, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
clamp_range_copy(
InputIterator first, InputIterator last,
typename std::iterator_traits<InputIterator>::value_type const& low,
typename std::iterator_traits<InputIterator>::value_type const& high,
Compare comp
)
{
return sprout::fixed::clamp_range_copy<Result>(first, last, low, high, comp);
}
template<typename Result, typename InputIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
clamp_range_copy(
InputIterator first, InputIterator last,
typename std::iterator_traits<InputIterator>::value_type const& low,
typename std::iterator_traits<InputIterator>::value_type const& high
)
{
return sprout::fixed::clamp_range_copy<Result>(first, last, low, high);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_CLAMP_RANGE_COPY_HPP

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

@ -15,6 +15,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/while_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/not1.hpp>
#include <sprout/algorithm/find_if.hpp>
#include <sprout/algorithm/fixed/results.hpp>
@ -113,7 +115,20 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::copy_until;
template<
typename InputIterator, typename Result, typename Predicate,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
copy_until(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
return sprout::fixed::copy_until(first, last, result, pred);
}
template<typename Result, typename InputIterator, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
copy_until(InputIterator first, InputIterator last, Predicate pred) {
return sprout::fixed::copy_until<Result>(first, last, pred);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_UNTIL_HPP

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

@ -15,6 +15,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/while_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/find_if_not.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/algorithm/fixed/copy.hpp>
@ -112,7 +114,20 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::copy_while;
template<
typename InputIterator, typename Result, typename Predicate,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
copy_while(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
return sprout::fixed::copy_while(first, last, result, pred);
}
template< typename Result, typename InputIterator,typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
copy_while(InputIterator first, InputIterator last, Predicate pred) {
return sprout::fixed::copy_while<Result>(first, last, pred);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_WHILE_HPP

49
sprout/algorithm/fixed/merge.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/merge_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
@ -158,7 +160,52 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::merge;
template<
typename InputIterator1, typename InputIterator2, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::merge(first1, last1, first2, last2, result, comp);
}
template<
typename InputIterator1, typename InputIterator2, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result
)
{
return sprout::fixed::merge(first1, last1, first2, last2, result);
}
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::merge<Result>(first1, last1, first2, last2, comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
merge(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::merge<Result>(first1, last1, first2, last2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_MERGE_HPP

49
sprout/algorithm/fixed/set_difference.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/set_difference_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
@ -158,7 +160,52 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::set_difference;
template<
typename InputIterator1, typename InputIterator2, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::set_difference(first1, last1, first2, last2, result, comp);
}
template<
typename InputIterator1, typename InputIterator2, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result
)
{
return sprout::fixed::set_difference(first1, last1, first2, last2, result);
}
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::set_difference<Result>(first1, last1, first2, last2, comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::set_difference<Result>(first1, last1, first2, last2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SET_DIFFERENCE_HPP

49
sprout/algorithm/fixed/set_intersection.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/set_intersection_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
@ -155,7 +157,52 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::set_intersection;
template<
typename InputIterator1, typename InputIterator2, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::set_intersection(first1, last1, first2, last2, result, comp);
}
template<
typename InputIterator1, typename InputIterator2, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result
)
{
return sprout::fixed::set_intersection(first1, last1, first2, last2, result);
}
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::set_intersection<Result>(first1, last1, first2, last2, comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_intersection(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::set_intersection<Result>(first1, last1, first2, last2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SET_INTERSECTION_HPP

49
sprout/algorithm/fixed/set_symmetric_difference.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/set_symmetric_difference_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
@ -163,7 +165,52 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::set_symmetric_difference;
template<
typename InputIterator1, typename InputIterator2, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_symmetric_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::set_symmetric_difference(first1, last1, first2, last2, result, comp);
}
template<
typename InputIterator1, typename InputIterator2, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_symmetric_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result
)
{
return sprout::fixed::set_symmetric_difference(first1, last1, first2, last2, result);
}
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_symmetric_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::set_symmetric_difference<Result>(first1, last1, first2, last2, comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_symmetric_difference(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::set_symmetric_difference<Result>(first1, last1, first2, last2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SET_SYMMETRIC_DIFFERENCE_HPP

49
sprout/algorithm/fixed/set_union.hpp
View file

@ -14,6 +14,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/set_union_iterator.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/functional/less.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
@ -163,7 +165,52 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::set_union;
template<
typename InputIterator1, typename InputIterator2, typename Result, typename Compare,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_union(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp
)
{
return sprout::fixed::set_union(first1, last1, first2, last2, result, comp);
}
template<
typename InputIterator1, typename InputIterator2, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_union(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result
)
{
return sprout::fixed::set_union(first1, last1, first2, last2, result);
}
template<typename Result, typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_union(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp
)
{
return sprout::fixed::set_union<Result>(first1, last1, first2, last2, comp);
}
template<typename Result, typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
set_union(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2
)
{
return sprout::fixed::set_union<Result>(first1, last1, first2, last2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SET_UNION_HPP

18
sprout/algorithm/fixed/swap_element_copy.hpp
View file

@ -16,6 +16,8 @@
#include <sprout/container/functions.hpp>
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/pit/pit.hpp>
#include <sprout/detail/container_complate.hpp>
@ -133,7 +135,21 @@ namespace sprout {
}
} // namespace fixed
using sprout::fixed::swap_element_copy;
template<
typename ForwardIterator, typename Result,
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
swap_element_copy(ForwardIterator first, ForwardIterator last, Result const& result, ForwardIterator pos1, ForwardIterator pos2) {
typedef typename std::iterator_traits<ForwardIterator>::iterator_category* category;
return sprout::fixed::detail::swap_element_copy(first, last, result, pos1, pos2, category());
}
template<typename Result, typename ForwardIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
swap_element_copy(ForwardIterator first, ForwardIterator last, ForwardIterator pos1, ForwardIterator pos2) {
return sprout::fixed::swap_element_copy(first, last, sprout::pit<Result>(), pos1, pos2);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP