//---------------------------------------------------------------------------// // Copyright (c) 2014 Roshan // // 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 // // See http://boostorg.github.com/compute for more information. //---------------------------------------------------------------------------// #define BOOST_TEST_MODULE TestIsPermutation #include #include #include #include #include #include #include "check_macros.hpp" #include "context_setup.hpp" namespace bc = boost::compute; BOOST_AUTO_TEST_CASE(is_permutation_int) { int dataset1[] = {1, 3, 1, 2, 5}; bc::vector vector1(dataset1, dataset1 + 5, queue); int dataset2[] = {3, 1, 5, 1, 2}; bc::vector vector2(dataset2, dataset2 + 5, queue); bool result = bc::is_permutation(vector1.begin(), vector1.begin() + 5, vector2.begin(), vector2.begin() + 5, queue); BOOST_VERIFY(result == true); vector2[0] = 1; result = bc::is_permutation(vector1.begin(), vector1.begin() + 5, vector2.begin(), vector2.begin() + 5, queue); BOOST_VERIFY(result == false); } BOOST_AUTO_TEST_CASE(is_permutation_string) { char dataset1[] = "abade"; bc::vector vector1(dataset1, dataset1 + 5, queue); char dataset2[] = "aadeb"; bc::vector vector2(dataset2, dataset2 + 5, queue); bool result = bc::is_permutation(vector1.begin(), vector1.begin() + 5, vector2.begin(), vector2.begin() + 5, queue); BOOST_VERIFY(result == true); vector2[0] = 'b'; result = bc::is_permutation(vector1.begin(), vector1.begin() + 5, vector2.begin(), vector2.begin() + 5, queue); BOOST_VERIFY(result == false); } BOOST_AUTO_TEST_SUITE_END()