/*============================================================================= Copyright (c) 2011-2017 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_LIBS_ALGORITHM_TEST_POP_HEAP_CPP #define SPROUT_LIBS_ALGORITHM_TEST_POP_HEAP_CPP #include #include #include #include #include namespace testspr { static void algorithm_pop_heap_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}; // pop heap { SPROUT_STATIC_CONSTEXPR auto heap = sprout::pop_heap( arr1 ); TESTSPR_BOTH_ASSERT(testspr::equal( heap, array{{9, 8, 5, 6, 7, 4, 3, 1, 2, 10}} )); } { SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::pop_heap( arr1 ); TESTSPR_BOTH_ASSERT(testspr::equal( heap, array{{9, 8, 5, 6, 7, 4, 3, 1, 2}} )); } // pop heap // from sub range { SPROUT_STATIC_CONSTEXPR auto heap = sprout::pop_heap( sprout::sub(arr1, 2, 10) ); TESTSPR_BOTH_ASSERT(testspr::equal( heap, array{{7, 6, 4, 5, 3, 1, 2, 9}} )); TESTSPR_BOTH_ASSERT(testspr::equal( sprout::get_internal(heap), array{{10, 8, 7, 6, 4, 5, 3, 1, 2, 9}} )); } { SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::pop_heap( sprout::sub(arr1, 2, 10) ); TESTSPR_BOTH_ASSERT(testspr::equal( heap, array{{7, 6, 4, 5, 3, 1, 2}} )); TESTSPR_BOTH_ASSERT(testspr::equal( sprout::get_internal(heap), array{{10, 8, 7, 6, 4, 5, 3, 1, 2, 9}} )); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_pop_heap_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_POP_HEAP_CPP