mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-16 15:14:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix recursion depth: is_heap, is_heap_until

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-16 18:20:24 +09:00
parent 0201107eec
commit 86f68671a1
5 changed files with 232 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

85
libs/algorithm/test/is_heap.cpp Normal file
View file

@ -0,0 +1,85 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_CPP
#include <sprout/algorithm/is_heap.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_is_heap_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 13, 14, 11}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr1),
sprout::end(arr1)
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr2),
sprout::end(arr2)
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr1),
sprout::begin(arr1) + 5
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr2),
sprout::begin(arr2) + 5
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr1),
sprout::end(arr1),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr2),
sprout::end(arr2),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::is_heap(
sprout::begin(arr2),
sprout::begin(arr2) + 5,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_is_heap_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_CPP

85
libs/algorithm/test/is_heap_until.cpp Normal file
View file

@ -0,0 +1,85 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_UNTIL_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_UNTIL_CPP
#include <sprout/algorithm/is_heap_until.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_is_heap_until_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 13, 14, 11}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr1),
sprout::end(arr1)
);
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr2),
sprout::end(arr2)
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr1),
sprout::begin(arr1) + 5
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr2),
sprout::begin(arr2) + 5
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr2) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr1),
sprout::end(arr1),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr2),
sprout::end(arr2),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr2) + 7);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::is_heap_until(
sprout::begin(arr2),
sprout::begin(arr2) + 5,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr2) + 5);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_is_heap_until_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_HEAP_UNTIL_CPP

4
libs/algorithm/test/non_modifying.cpp
View file

@ -32,6 +32,8 @@
#include "./equal_range.cpp"
#include "./binary_search.cpp"
#include "./includes.cpp"
#include "./is_heap.cpp"
#include "./is_heap_until.cpp"
#ifdef TESTSPR_CPP_INCLUDE_DISABLE_SPROUT_LIBS_ALGORITHM_TEST_NON_MODIFYIING_CPP
# undef TESTSPR_CPP_INCLUDE
@ -65,6 +67,8 @@ namespace testspr {
testspr::algorithm_equal_range_test();
testspr::algorithm_binary_search_test();
testspr::algorithm_includes_test();
testspr::algorithm_is_heap_test();
testspr::algorithm_is_heap_until_test();
}
} // namespace testspr