//---------------------------------------------------------------------------// // 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 TestSearch #include #include #include #include #include #include #include "check_macros.hpp" #include "context_setup.hpp" namespace bc = boost::compute; BOOST_AUTO_TEST_CASE(search_int) { int data[] = {1, 4, 2, 6, 3, 2, 6, 3, 4, 6, 6}; bc::vector vectort(data, data + 11, queue); int datap[] = {2, 6}; bc::vector vectorp(datap, datap + 2, queue); bc::vector::iterator iter = bc::search(vectort.begin(), vectort.end(), vectorp.begin(), vectorp.end(), queue); BOOST_CHECK(iter == vectort.begin() + 2); vectorp[1] = 9; iter = bc::search(vectort.begin(), vectort.end(), vectorp.begin(), vectorp.end(), queue); BOOST_CHECK(iter == vectort.begin() + 11); vectorp[0] = 6; vectorp[1] = 6; iter = bc::search(vectort.begin(), vectort.end(), vectorp.begin(), vectorp.end(), queue); BOOST_CHECK(iter == vectort.begin() + 9); } BOOST_AUTO_TEST_CASE(search_string) { char text[] = "sdabababacabskjabacab"; bc::vector vectort(text, text + 21, queue); char pattern[] = "aba"; bc::vector vectorp(pattern, pattern + 3, queue); bc::vector::iterator iter = bc::search(vectort.begin(), vectort.end(), vectorp.begin(), vectorp.end(), queue); BOOST_CHECK(iter == vectort.begin() + 2); } BOOST_AUTO_TEST_SUITE_END()