| 23 | namespace bc = boost::compute; |
| 24 | |
| 25 | BOOST_AUTO_TEST_CASE(search_int) |
| 26 | { |
| 27 | int data[] = {1, 4, 2, 6, 3, 2, 6, 3, 4, 6, 6}; |
| 28 | bc::vector<bc::int_> vectort(data, data + 11, queue); |
| 29 | |
| 30 | int datap[] = {2, 6}; |
| 31 | bc::vector<bc::int_> vectorp(datap, datap + 2, queue); |
| 32 | |
| 33 | bc::vector<bc::int_>::iterator iter = |
| 34 | bc::search(vectort.begin(), vectort.end(), |
| 35 | vectorp.begin(), vectorp.end(), queue); |
| 36 | |
| 37 | BOOST_CHECK(iter == vectort.begin() + 2); |
| 38 | |
| 39 | vectorp[1] = 9; |
| 40 | |
| 41 | iter = |
| 42 | bc::search(vectort.begin(), vectort.end(), |
| 43 | vectorp.begin(), vectorp.end(), queue); |
| 44 | |
| 45 | BOOST_CHECK(iter == vectort.begin() + 11); |
| 46 | |
| 47 | vectorp[0] = 6; |
| 48 | vectorp[1] = 6; |
| 49 | |
| 50 | iter = |
| 51 | bc::search(vectort.begin(), vectort.end(), |
| 52 | vectorp.begin(), vectorp.end(), queue); |
| 53 | |
| 54 | BOOST_CHECK(iter == vectort.begin() + 9); |
| 55 | } |
| 56 | |
| 57 | BOOST_AUTO_TEST_CASE(search_string) |
| 58 | { |