/*============================================================================= Copyright (c) 2011-2016 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_ALL_OF_HPP #define SPROUT_ALGORITHM_ALL_OF_HPP #include #include #include #include #include #include namespace sprout { namespace detail { template inline SPROUT_CONSTEXPR bool all_of_impl_ra( RandomAccessIterator const& first, RandomAccessIterator const& last, Predicate pred, typename std::iterator_traits::difference_type pivot ) { return pivot == 0 ? pred(*first) : sprout::detail::all_of_impl_ra( first, sprout::next(first, pivot), pred, pivot / 2 ) && sprout::detail::all_of_impl_ra( sprout::next(first, pivot), last, pred, (sprout::distance(first, last) - pivot) / 2 ) ; } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_constant_distance_iterator::value, bool >::type all_of( RandomAccessIterator const& first, RandomAccessIterator const& last, Predicate pred, std::random_access_iterator_tag* ) { return first == last ? true : sprout::detail::all_of_impl_ra(first, last, pred, sprout::distance(first, last) / 2) ; } template inline SPROUT_CONSTEXPR sprout::pair all_of_impl_1( sprout::pair const& current, InputIterator const& last, Predicate pred, typename std::iterator_traits::difference_type n ) { typedef sprout::pair type; return !current.second || current.first == last ? current : n == 1 ? pred(*current.first) ? type(sprout::next(current.first), true) : type(current.first, false) : sprout::detail::all_of_impl_1( sprout::detail::all_of_impl_1( current, last, pred, n / 2 ), last, pred, n - n / 2 ) ; } template inline SPROUT_CONSTEXPR sprout::pair all_of_impl( sprout::pair const& current, InputIterator const& last, Predicate pred, typename std::iterator_traits::difference_type n ) { return !current.second || current.first == last ? current : sprout::detail::all_of_impl( sprout::detail::all_of_impl_1( current, last, pred, n ), last, pred, n * 2 ) ; } template inline SPROUT_CONSTEXPR bool all_of( InputIterator const& first, InputIterator const& last, Predicate pred, std::input_iterator_tag* ) { typedef sprout::pair type; return sprout::detail::all_of_impl(type(first, true), last, pred, 1).second; } } // namespace detail // 25.2.1 All of // // recursion depth: // O(log N) // template inline SPROUT_CONSTEXPR bool all_of(InputIterator first, InputIterator last, Predicate pred) { typedef typename std::iterator_traits::iterator_category* category; return sprout::detail::all_of(first, last, pred, category()); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_ALL_OF_HPP