//---------------------------------------------------------------------------// // Copyright (c) 2013 Kyle Lutz // // 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 TestMismatch #include #include #include #include #include "context_setup.hpp" BOOST_AUTO_TEST_CASE(mismatch_int) { int data1[] = { 1, 2, 3, 4, 5, 6 }; int data2[] = { 1, 2, 3, 7, 5, 6 }; boost::compute::vector vector1(data1, data1 + 6, queue); boost::compute::vector vector2(data2, data2 + 6, queue); typedef boost::compute::vector::iterator iter; std::pair location = boost::compute::mismatch(vector1.begin(), vector1.end(), vector2.begin(), queue); BOOST_CHECK(location.first == vector1.begin() + 3); BOOST_CHECK_EQUAL(int(*location.first), int(4)); BOOST_CHECK(location.second == vector2.begin() + 3); BOOST_CHECK_EQUAL(int(*location.second), int(7)); } BOOST_AUTO_TEST_CASE(mismatch_different_range_sizes) { boost::compute::vector a(10, context); boost::compute::vector b(20, context); boost::compute::fill(a.begin(), a.end(), 3, queue); boost::compute::fill(b.begin(), b.end(), 3, queue); typedef boost::compute::vector::iterator iter; std::pair location; location = boost::compute::mismatch( a.begin(), a.end(), b.begin(), b.end(), queue ); BOOST_CHECK(location.first == a.end()); BOOST_CHECK(location.second == b.begin() + 10); location = boost::compute::mismatch( b.begin(), b.end(), a.begin(), a.end(), queue ); BOOST_CHECK(location.first == b.begin() + 10); BOOST_CHECK(location.second == a.end()); } BOOST_AUTO_TEST_SUITE_END()