mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-11-14 10:39:05 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
Sprout/libs/algorithm/test/find_end.cpp

230 lines
7.7 KiB
C++
Raw Normal View History

add copyright
2013-08-08 09:54:33 +00:00
/*=============================================================================
add tested compiler
2015-01-11 17:03:30 +00:00
Copyright (c) 2011-2015 Bolero MURAKAMI
add copyright
2013-08-08 09:54:33 +00:00
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)
=============================================================================*/
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
#ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_END_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_FIND_END_CPP
#include <sprout/algorithm/find_end.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_find_end_test() {
using namespace sprout;
{
fix recursion depth: find_end
2012-12-13 04:03:18 +00:00
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 3, 4, 5}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 3>{{3, 4, 5}};
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 3>{{6, 5, 4}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr2),
sprout::end(arr2)
);
fix recursion depth: find_end
2012-12-13 04:03:18 +00:00
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr3),
sprout::end(arr3)
);
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr2),
sprout::end(arr2)
);
fix recursion depth: find_end
2012-12-13 04:03:18 +00:00
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 2);
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr3),
sprout::end(arr3)
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr2),
sprout::end(arr2),
testspr::equal_to<int>()
);
fix recursion depth: find_end
2012-12-13 04:03:18 +00:00
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr3),
sprout::end(arr3),
testspr::equal_to<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr2),
sprout::end(arr2),
testspr::equal_to<int>()
);
fix recursion depth: find_end
2012-12-13 04:03:18 +00:00
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 2);
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr3),
sprout::end(arr3),
testspr::equal_to<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::end(arr1)),
testspr::reduce_forward(sprout::begin(arr2)),
testspr::reduce_forward(sprout::end(arr2))
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::end(arr1)),
testspr::reduce_forward(sprout::begin(arr3)),
testspr::reduce_forward(sprout::end(arr3))
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
).base();
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::begin(arr1) + 5),
testspr::reduce_forward(sprout::begin(arr2)),
testspr::reduce_forward(sprout::end(arr2))
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 2);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::begin(arr1) + 5),
testspr::reduce_forward(sprout::begin(arr3)),
testspr::reduce_forward(sprout::end(arr3))
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::end(arr1)),
testspr::reduce_forward(sprout::begin(arr2)),
testspr::reduce_forward(sprout::end(arr2)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::end(arr1)),
testspr::reduce_forward(sprout::begin(arr3)),
testspr::reduce_forward(sprout::end(arr3)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::begin(arr1) + 5),
testspr::reduce_forward(sprout::begin(arr2)),
testspr::reduce_forward(sprout::end(arr2)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 2);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_forward(sprout::begin(arr1)),
testspr::reduce_forward(sprout::begin(arr1) + 5),
testspr::reduce_forward(sprout::begin(arr3)),
testspr::reduce_forward(sprout::end(arr3)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
testspr::reduce_random_access(sprout::begin(arr2)),
testspr::reduce_random_access(sprout::end(arr2)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 7);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::end(arr1)),
testspr::reduce_random_access(sprout::begin(arr3)),
testspr::reduce_random_access(sprout::end(arr3)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::end(arr1));
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
testspr::reduce_random_access(sprout::begin(arr2)),
testspr::reduce_random_access(sprout::end(arr2)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 2);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_end(
rename reduct_iterator -> reduce_iterator
2015-05-11 01:34:12 +00:00
testspr::reduce_random_access(sprout::begin(arr1)),
testspr::reduce_random_access(sprout::begin(arr1) + 5),
testspr::reduce_random_access(sprout::begin(arr3)),
testspr::reduce_random_access(sprout::end(arr3)),
fix recursion depth O(logN): some algorithms
2013-01-03 08:01:50 +00:00
testspr::equal_to<int>()
).base();
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
fix recursion depth: find_first_of, adjacent_find
2012-12-11 03:59:36 +00:00
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_find_end_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_END_CPP
Reference in a new issue Copy permalink