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

fix recursion depth: includes

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-15 23:48:52 +09:00
parent eea1c2bbc1
commit 0201107eec
14 changed files with 442 additions and 71 deletions
Download patch file Download diff file Expand all files Collapse all files

41
libs/algorithm/test/upper_bound.cpp Normal file
View file

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