mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-08-29 14:50:52 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

最初

Browse source
This commit is contained in:
bolero-MURAKAMI 2011-09-01 02:48:32 +00:00
commit b3bb8121e8
362 changed files with 16820 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

131
sprout/detail/algorithm.hpp Normal file
View file

@ -0,0 +1,131 @@
#ifndef SPROUT_DETAIL_ALGORITHM_HPP
#define SPROUT_DETAIL_ALGORITHM_HPP
#include <iterator>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
//
// min
//
template<typename T>
SPROUT_CONSTEXPR T const& min(T const& a, T const& b) {
return b < a ? b : a;
}
template<typename T, typename Compare>
SPROUT_CONSTEXPR T const& min(T const& a, T const& b, Compare comp) {
return comp(b, a) ? b : a;
}
//
// max
//
template<typename T>
SPROUT_CONSTEXPR T const& max(T const& a, T const& b) {
return a < b ? b : a;
}
template<typename T, typename Compare>
SPROUT_CONSTEXPR T const& max(T const& a, T const& b, Compare comp) {
return comp(a, b) ? b : a;
}
//
// count
//
template<typename Iterator, typename T>
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type count(
Iterator first,
Iterator last,
T const & value
)
{
return first == last
? 0
: (*first == value ? 1 : 0) + sprout::detail::count(first + 1, last, value)
;
}
//
// count_if
//
template<typename Iterator, typename Predicate>
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type count_if(
Iterator first,
Iterator last,
Predicate pred
)
{
return first == last
? 0
: (pred(*first) ? 1 : 0) + sprout::detail::count_if(first + 1, last, pred);
}
//
// equal
//
template<typename Iterator1, typename Iterator2>
SPROUT_CONSTEXPR bool equal(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2
)
{
return first1 == last1
? true
: *first1 == *first2 && sprout::detail::equal(first1 + 1, last1, first2 + 1)
;
}
template<typename Iterator1, typename Iterator2, typename Predicate>
SPROUT_CONSTEXPR bool equal(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2,
Predicate pred
)
{
return first1 == last1
? true
: pred(*first1, *first2) && sprout::detail::equal(first1 + 1, last1, first2 + 1, pred);
}
//
// lexicographical_compare
//
template<typename Iterator1, typename Iterator2>
SPROUT_CONSTEXPR bool lexicographical_compare(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2,
Iterator2 last2
)
{
return first2 == last2
? false
: first1 == last1 || *first1 < *first2
? true
: *first2 < *first1
? false
: sprout::detail::lexicographical_compare(first1 + 1, last1, first2 + 1, last2);
}
template<typename Iterator1, typename Iterator2, typename Compare>
SPROUT_CONSTEXPR bool lexicographical_compare(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2,
Iterator2 last2,
Compare comp
)
{
return first2 == last2
? false
: first1 == last1 || comp(*first1, *first2)
? true
: comp(*first2, *first1)
? false
: sprout::detail::lexicographical_compare(first1 + 1, last1, first2 + 1, last2, comp);
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_ALGORITHM_HPP