#ifndef SPROUT_ALGORITHM_NONE_OF_HPP #define SPROUT_ALGORITHM_NONE_OF_HPP #include #include #include #include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT namespace sprout { namespace detail { template inline SPROUT_CONSTEXPR bool none_of_impl_ra( RandomAccessIterator first, RandomAccessIterator last, Predicate pred, typename std::iterator_traits::difference_type pivot ) { return pivot == 0 ? !pred(*first) : sprout::detail::none_of_impl_ra( first, sprout::next(first, pivot), pred, pivot / 2 ) && sprout::detail::none_of_impl_ra( sprout::next(first, pivot), last, pred, (NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) - pivot) / 2 ) ; } template inline SPROUT_CONSTEXPR bool none_of( RandomAccessIterator first, RandomAccessIterator last, Predicate pred, std::random_access_iterator_tag* ) { return first == last ? true : sprout::detail::none_of_impl_ra(first, last, pred, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2) ; } // Copyright (C) 2011 RiSK (sscrisk) template inline SPROUT_CONSTEXPR bool none_of_impl(InputIterator first, InputIterator last, Predicate pred) { return first == last ? true : !pred(*first) && sprout::detail::none_of_impl(sprout::next(first), last, pred) ; } template inline SPROUT_CONSTEXPR bool none_of( InputIterator first, InputIterator last, Predicate pred, void* ) { return sprout::detail::none_of_impl(first, last, pred); } } //namespace detail // 25.2.3 None of // // recursion depth: // [first, last) is RandomAccessIterator -> O(log N) // otherwise -> O(N) // template inline SPROUT_CONSTEXPR bool none_of(InputIterator first, InputIterator last, Predicate pred) { typedef typename std::iterator_traits::iterator_category* category; return sprout::detail::none_of(first, last, pred, category()); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_NONE_OF_HPP