/
BirdLeon
/
ROBLOX2016
Обзор
Документация
Войти
/
BirdLeon
/
ROBLOX2016
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
main
Library/boost/libs/compute/test/test_array.cpp
87 строк
3 KB
PatoFlamejanteTV
full source code
19 дек 2024, 19:11
19 дек 2024, 19:11
05db15d
Код
Авторство
О чём код?
//---------------------------------------------------------------------------// // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com> // // 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 TestArray #include <boost/test/unit_test.hpp> #include <boost/compute/system.hpp> #include <boost/compute/algorithm/copy.hpp> #include <boost/compute/container/array.hpp> #include <boost/compute/container/vector.hpp> #include "check_macros.hpp" #include "context_setup.hpp" BOOST_AUTO_TEST_CASE(concept_check) { BOOST_CONCEPT_ASSERT((boost::Container<boost::compute::array<int, 3> >)); // BOOST_CONCEPT_ASSERT((boost::SequenceConcept<boost::compute::array<int, 3> >)); BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator<boost::compute::array<int, 3>::iterator>)); BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator<boost::compute::array<int, 3>::const_iterator>)); } BOOST_AUTO_TEST_CASE(size) { boost::compute::array<int, 0> empty_array(context); BOOST_CHECK_EQUAL(empty_array.size(), size_t(0)); boost::compute::array<int, 10> array10(context); BOOST_CHECK_EQUAL(array10.size(), size_t(10)); } BOOST_AUTO_TEST_CASE(at) { boost::compute::array<int, 3> array(context); array[0] = 3; array[1] = -2; array[2] = 5; BOOST_CHECK_EQUAL(array.at(0), 3); BOOST_CHECK_EQUAL(array.at(1), -2); BOOST_CHECK_EQUAL(array.at(2), 5); BOOST_CHECK_THROW(array.at(3), std::out_of_range); } BOOST_AUTO_TEST_CASE(copy_from_vector) { int data[] = { 3, 6, 9, 12 }; boost::compute::vector<int> vector(data, data + 4, queue); boost::compute::array<int, 4> array(context); boost::compute::copy(vector.begin(), vector.end(), array.begin(), queue); CHECK_RANGE_EQUAL(int, 4, array, (3, 6, 9, 12)); } BOOST_AUTO_TEST_CASE(fill) { boost::compute::array<int, 4> array(context); array.fill(0); CHECK_RANGE_EQUAL(int, 4, array, (0, 0, 0, 0)); array.fill(17); CHECK_RANGE_EQUAL(int, 4, array, (17, 17, 17, 17)); } BOOST_AUTO_TEST_CASE(swap) { int data[] = { 1, 2, 6, 9 }; boost::compute::array<int, 4> a(context); boost::compute::copy(data, data + 4, a.begin(), queue); CHECK_RANGE_EQUAL(int, 4, a, (1, 2, 6, 9)); boost::compute::array<int, 4> b(context); b.fill(3); CHECK_RANGE_EQUAL(int, 4, b, (3, 3, 3, 3)); a.swap(b); CHECK_RANGE_EQUAL(int, 4, a, (3, 3, 3, 3)); CHECK_RANGE_EQUAL(int, 4, b, (1, 2, 6, 9)); } BOOST_AUTO_TEST_SUITE_END()