King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-08-03 12:49:50 +00:00
Code Issues Releases Wiki Activity

最初

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

24
sprout/detail/functional.hpp Normal file
View file

@ -0,0 +1,24 @@
#ifndef SPROUT_DETAIL_FUNCTIONAL_HPP
#define SPROUT_DETAIL_FUNCTIONAL_HPP
#include <functional>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
//
// less
//
template<typename T>
class less
: public std::binary_function<T, T, bool>
{
public:
SPROUT_CONSTEXPR bool operator()(T const& lhs, T const& rhs) const {
return lhs < rhs;
}
};
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_FUNCTIONAL_HPP

30
sprout/detail/if.hpp Normal file
View file

@ -0,0 +1,30 @@
#ifndef SPROUT_DETAIL_IF_HPP
#define SPROUT_DETAIL_IF_HPP
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
//
// if_c
//
template<bool C, typename T1, typename T2>
struct if_c {
typedef T1 type;
};
template<typename T1, typename T2>
struct if_c<false, T1, T2> {
typedef T2 type;
};
//
// if_
//
template<typename Cond, typename T1, typename T2>
struct if_
: public sprout::detail::if_c<Cond::value, T1, T2>
{};
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_IF_HPP

182
sprout/detail/iterator.hpp Normal file
View file

@ -0,0 +1,182 @@
#ifndef SPROUT_DETAIL_ITERATOR_HPP
#define SPROUT_DETAIL_ITERATOR_HPP
#include <iterator>
#include <sprout/config.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT_DETAIL
namespace sprout {
namespace detail {
//
// distance
//
template<typename Iterator>
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type distance(
Iterator first,
Iterator last
)
{
return first == last ? 0 : 1 + sprout::detail::distance(first + 1, last);
}
template<typename Iterator>
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type bidirectional_distance_impl(
Iterator first1,
Iterator first2,
Iterator last,
typename std::iterator_traits<Iterator>::difference_type current = 1
)
{
return first1 == last
? current
: first2 == last
? -current
: sprout::detail::bidirectional_distance_impl(first1 + 1, first2 - 1, last, current + 1)
;
}
//
// bidirectional_distance
//
template<typename Iterator>
SPROUT_CONSTEXPR typename std::iterator_traits<Iterator>::difference_type bidirectional_distance(
Iterator first,
Iterator last
)
{
return first == last ? 0 : sprout::detail::bidirectional_distance_impl(first + 1, first - 1, last);
}
//
// reverse_iterator
//
template<typename Iterator>
class reverse_iterator
: public std::iterator<
typename std::iterator_traits<Iterator>::iterator_category,
typename std::iterator_traits<Iterator>::value_type,
typename std::iterator_traits<Iterator>::difference_type,
typename std::iterator_traits<Iterator>::pointer,
typename std::iterator_traits<Iterator>::reference
>
{
public:
typedef Iterator iterator_type;
typedef typename std::iterator_traits<iterator_type>::iterator_category iterator_category;
typedef typename std::iterator_traits<iterator_type>::value_type value_type;
typedef typename std::iterator_traits<iterator_type>::difference_type difference_type;
typedef typename std::iterator_traits<iterator_type>::pointer pointer;
typedef typename std::iterator_traits<iterator_type>::reference reference;
protected:
iterator_type current;
private:
iterator_type deref_tmp;
public:
reverse_iterator() = default;
reverse_iterator(reverse_iterator const&) = default;
SPROUT_CONSTEXPR explicit reverse_iterator(iterator_type it)
: current(it)
, deref_tmp(current - 1)
{}
template<typename U>
SPROUT_CONSTEXPR reverse_iterator(reverse_iterator<U> const& it)
: current(it)
, deref_tmp(current - 1)
{}
template<typename U>
reverse_iterator& operator=(const reverse_iterator<U>& it) {
reverse_iterator temp(it);
temp.swap(this);
return this;
}
SPROUT_CONSTEXPR iterator_type base() const {
return current;
}
SPROUT_CONSTEXPR reference operator*() const {
return *deref_tmp;
}
SPROUT_CONSTEXPR pointer operator->() const {
return &*deref_tmp;
}
reverse_iterator& operator++() {
--current;
--deref_tmp;
return this;
}
reverse_iterator operator++(int) {
reverse_iterator result(this);
--current;
--deref_tmp;
return result;
}
reverse_iterator& operator--() {
++current;
++deref_tmp;
return this;
}
reverse_iterator operator--(int) {
reverse_iterator temp(this);
++current;
++deref_tmp;
return temp;
}
SPROUT_CONSTEXPR reverse_iterator operator+(difference_type n) const {
return reverse_iterator(current - n);
}
SPROUT_CONSTEXPR reverse_iterator operator-(difference_type n) const {
return reverse_iterator(current + n);
}
reverse_iterator& operator+=(difference_type n) {
reverse_iterator temp(current - n);
temp.swap(this);
return this;
}
reverse_iterator& operator-=(difference_type n) {
reverse_iterator temp(current + n);
temp.swap(this);
return this;
}
SPROUT_CONSTEXPR reference operator[](difference_type n) const {
return *(deref_tmp - n);
}
void swap(reverse_iterator& other) {
using std::swap;
swap(current, other.current);
swap(deref_tmp, other.deref_tmp);
}
};
template <typename Iterator1, typename Iterator2>
SPROUT_CONSTEXPR bool operator==(
sprout::detail::reverse_iterator<Iterator1> const& lhs,
sprout::detail::reverse_iterator<Iterator2> const& rhs
)
{
return lhs.base() == rhs.base();
}
template <typename Iterator1, typename Iterator2>
SPROUT_CONSTEXPR bool operator!=(
sprout::detail::reverse_iterator<Iterator1> const& lhs,
sprout::detail::reverse_iterator<Iterator2> const& rhs
)
{
return !(lhs == rhs);
}
template <typename Iterator>
SPROUT_CONSTEXPR sprout::detail::reverse_iterator<Iterator> operator+(
typename sprout::detail::reverse_iterator<Iterator>::difference_type n,
sprout::detail::reverse_iterator<Iterator> const& it
)
{
return it + n;
}
//
// swap
//
template<typename Iterator>
void swap(sprout::detail::reverse_iterator<Iterator>& lhs, sprout::detail::reverse_iterator<Iterator>& rhs) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(lhs.swap(rhs))) {
lhs.swap(rhs);
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_ITERATOR_HPP

72
sprout/detail/overlap_count.hpp Normal file
View file

@ -0,0 +1,72 @@
#ifndef SPROUT_DETAIL_OVERLAP_COUNT_HPP
#define SPROUT_DETAIL_OVERLAP_COUNT_HPP
#include <iterator>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
template<typename Iterator>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator>::difference_type overlap_count_impl(
Iterator first,
Iterator last,
typename std::iterator_traits<Iterator>::value_type const& value,
typename std::iterator_traits<Iterator>::difference_type current = 0
)
{
return first == last
? 0
: *first == value
? 1 + sprout::detail::overlap_count_impl(first + 1, last, value)
: sprout::detail::overlap_count_impl(first + 1, last, *first)
;
}
//
// overlap_count
//
template<typename Iterator>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator>::difference_type overlap_count(
Iterator first,
Iterator last
)
{
return first == last
? 0
: sprout::detail::overlap_count_impl(first + 1, last, *first)
;
}
template<typename Iterator, typename Predicate>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator>::difference_type overlap_count_impl(
Iterator first,
Iterator last,
Predicate pred,
typename std::iterator_traits<Iterator>::value_type const& value
)
{
return first == last
? 0
: pred(*first, value)
? 1 + sprout::detail::overlap_count_impl(first + 1, last, pred, value)
: sprout::detail::overlap_count_impl(first + 1, last, pred, *first)
;
}
//
// overlap_count
//
template<typename Iterator, typename Predicate>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator>::difference_type overlap_count(
Iterator first,
Iterator last,
Predicate pred
)
{
return first == last
? 0
: sprout::detail::overlap_count_impl(first + 1, last, pred, *first)
;
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_OVERLAP_COUNT_HPP

53
sprout/detail/overlap_count_2.hpp Normal file
View file

@ -0,0 +1,53 @@
#ifndef SPROUT_DETAIL_OVERLAP_COUNT_2_HPP
#define SPROUT_DETAIL_OVERLAP_COUNT_2_HPP
#include <iterator>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
//
// overlap_count_2
//
template<typename Iterator1, typename Iterator2, typename Compare>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator1>::difference_type overlap_count_2(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2,
Iterator2 last2,
Compare comp
)
{
return first1 != last1 && first2 != last2
? comp(*first1, *first2)
? sprout::detail::overlap_count_2(first1 + 1, last1, first2, last2, comp)
: comp(*first2, *first1)
? sprout::detail::overlap_count_2(first1, last1, first2 + 1, last2, comp)
: 1 + sprout::detail::overlap_count_2(first1 + 1, last1, first2 + 1, last2, comp)
: 0
;
}
//
// overlap_count_2
//
template<typename Iterator1, typename Iterator2>
SPROUT_CONSTEXPR inline typename std::iterator_traits<Iterator1>::difference_type overlap_count_2(
Iterator1 first1,
Iterator1 last1,
Iterator2 first2,
Iterator2 last2
)
{
return first1 != last1 && first2 != last2
? *first1 < *first2
? sprout::detail::overlap_count_2(first1 + 1, last1, first2, last2)
: *first2 < *first1
? sprout::detail::overlap_count_2(first1, last1, first2 + 1, last2)
: 1 + sprout::detail::overlap_count_2(first1 + 1, last1, first2 + 1, last2)
: 0
;
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_OVERLAP_COUNT_2_HPP

37
sprout/detail/param_at.hpp Normal file
View file

@ -0,0 +1,37 @@
#ifndef SPROUT_DETAIL_PARAM_AT_HPP
#define SPROUT_DETAIL_PARAM_AT_HPP
#include <cstddef>
#include <type_traits>
#include <sprout/config.hpp>
namespace sprout {
namespace detail {
template<typename R, typename T, typename... Values>
SPROUT_CONSTEXPR inline typename std::enable_if<
sizeof...(Values) == 0,
R
>::type param_at(
std::size_t n,
T const& v,
Values const&... values
)
{
return v;
}
template<typename R, typename T, typename... Values>
SPROUT_CONSTEXPR inline typename std::enable_if<
sizeof...(Values) != 0,
R
>::type param_at(
std::size_t n,
T const& v,
Values const&... values
)
{
return n == 0 ? v : sprout::detail::param_at<R>(n - 1, values...);
}
} // namespace detail
} // namespace sprout
#endif // #ifndef SPROUT_DETAIL_PARAM_AT_HPP