#ifndef SPROUT_RANGE_ALGORITHM_IS_HEAP_UNTIL_HPP #define SPROUT_RANGE_ALGORITHM_IS_HEAP_UNTIL_HPP #include #include #include #include #include namespace sprout { namespace range { // Copyright (C) 2011 RiSK (sscrisk) // 25.4.6.5 is_heap template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type is_heap_until(Range&& range) { return sprout::range::range_return::pack( sprout::is_heap_until( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type is_heap_until(Range&& range, Compare comp) { return sprout::range::range_return::pack( sprout::is_heap_until( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), comp ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type is_heap_until(Range&& range) { return sprout::range::range_return::pack( sprout::is_heap_until( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR typename sprout::range::range_return::type is_heap_until(Range&& range, Compare comp) { return sprout::range::range_return::pack( sprout::is_heap_until( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), comp ), sprout::forward(range) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_IS_HEAP_UNTIL_HPP