mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
104 lines
2.9 KiB
C++
104 lines
2.9 KiB
C++
|
#ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_FIRST_OF_CPP
|
||
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_FIND_FIRST_OF_CPP
|
||
|
|
|
||
|
|
#include <sprout/algorithm/find_first_of.hpp>
|
||
|
|
#include <sprout/array.hpp>
|
||
|
|
#include <sprout/container.hpp>
|
||
|
|
#include <testspr/tools.hpp>
|
||
|
|
|
||
|
|
namespace testspr {
|
||
|
|
static void algorithm_find_first_of_test() {
|
||
|
|
using namespace sprout;
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 3>{{4, 5, 6}};
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 3>{{11, 12 ,13}};
|
||
|
|
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::end(arr1),
|
||
|
|
sprout::begin(arr2),
|
||
|
|
sprout::end(arr2)
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(
|
||
|
|
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_first_of(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::begin(arr1) + 5,
|
||
|
|
sprout::begin(arr2),
|
||
|
|
sprout::end(arr2)
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(
|
||
|
|
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_first_of(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::end(arr1),
|
||
|
|
sprout::begin(arr2),
|
||
|
|
sprout::end(arr2),
|
||
|
|
testspr::equal_to<int>()
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(
|
||
|
|
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_first_of(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::begin(arr1) + 5,
|
||
|
|
sprout::begin(arr2),
|
||
|
|
sprout::end(arr2),
|
||
|
|
testspr::equal_to<int>()
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(
|
||
|
|
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);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} // namespace testspr
|
||
|
|
|
||
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
||
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_find_first_of_test
|
||
|
|
# include <testspr/include_main.hpp>
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_FIND_FIRST_OF_CPP
|