#ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_PERMUTATION_CPP #define SPROUT_LIBS_ALGORITHM_TEST_IS_PERMUTATION_CPP #include #include #include #include namespace testspr { static void algorithm_is_permutation_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}; SPROUT_STATIC_CONSTEXPR auto arr2 = array{{10, 9, 8, 1, 2, 3, 4, 5, 6, 7}}; SPROUT_STATIC_CONSTEXPR auto arr3 = array{{5, 4, 3, 2, 1, 11, 10, 9, 8, 7}}; { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::end(arr1), sprout::begin(arr2) ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::end(arr1), sprout::begin(arr3) ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::begin(arr1) + 5, sprout::begin(arr2) ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::begin(arr1) + 5, sprout::begin(arr3) ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::end(arr1), sprout::begin(arr2), testspr::equal_to() ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::end(arr1), sprout::begin(arr3), testspr::equal_to() ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::begin(arr1) + 5, sprout::begin(arr2), testspr::equal_to() ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_permutation( sprout::begin(arr1), sprout::begin(arr1) + 5, sprout::begin(arr3), testspr::equal_to() ); TESTSPR_BOTH_ASSERT(result); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_is_permutation_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_PERMUTATION_CPP