File: test_adjacent_difference.cpp

package info (click to toggle)
boost1.90 1.90.0-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 593,120 kB
  • sloc: cpp: 4,190,908; xml: 196,648; python: 34,618; ansic: 23,145; asm: 5,468; sh: 3,774; makefile: 1,161; perl: 1,020; sql: 728; ruby: 676; yacc: 478; java: 77; lisp: 24; csh: 6
file content (102 lines) | stat: -rw-r--r-- 3,245 bytes parent folder | download | duplicates (18)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
//---------------------------------------------------------------------------//
// Copyright (c) 2013-2014 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 TestAdjacentDifference
#include <boost/test/unit_test.hpp>

#include <boost/compute/system.hpp>
#include <boost/compute/command_queue.hpp>
#include <boost/compute/lambda.hpp>
#include <boost/compute/algorithm/iota.hpp>
#include <boost/compute/algorithm/copy.hpp>
#include <boost/compute/algorithm/fill.hpp>
#include <boost/compute/algorithm/all_of.hpp>
#include <boost/compute/algorithm/adjacent_difference.hpp>
#include <boost/compute/container/vector.hpp>

#include "check_macros.hpp"
#include "context_setup.hpp"

namespace compute = boost::compute;

BOOST_AUTO_TEST_CASE(adjacent_difference_int)
{
    using compute::int_;

    compute::vector<int_> a(5, context);
    compute::iota(a.begin(), a.end(), 0, queue);
    CHECK_RANGE_EQUAL(int_, 5, a, (0, 1, 2, 3, 4));

    compute::vector<int_> b(5, context);
    compute::vector<int_>::iterator iter =
        compute::adjacent_difference(a.begin(), a.end(), b.begin(), queue);
    BOOST_CHECK(iter == b.end());
    CHECK_RANGE_EQUAL(int_, 5, b, (0, 1, 1, 1, 1));

    int_ data[] = { 1, 9, 36, 48, 81 };
    compute::copy(data, data + 5, a.begin(), queue);
    CHECK_RANGE_EQUAL(int_, 5, a, (1, 9, 36, 48, 81));

    iter = compute::adjacent_difference(a.begin(), a.end(), b.begin(), queue);
    BOOST_CHECK(iter == b.end());
    CHECK_RANGE_EQUAL(int_, 5, b, (1, 8, 27, 12, 33));
}

BOOST_AUTO_TEST_CASE(adjacent_difference_first_eq_last)
{
    using compute::int_;

    compute::vector<int_> a(size_t(5), int_(1), queue);
    compute::vector<int_> b(size_t(5), int_(0), queue);
    compute::vector<int_>::iterator iter =
        compute::adjacent_difference(a.begin(), a.begin(), b.begin(), queue);
    BOOST_CHECK(iter == b.begin());
    CHECK_RANGE_EQUAL(int_, 5, b, (0, 0, 0, 0, 0));
}

BOOST_AUTO_TEST_CASE(adjacent_difference_first_eq_result)
{
    using compute::int_;

    compute::vector<int_> a(5, context);
    compute::iota(a.begin(), a.end(), 0, queue);
    CHECK_RANGE_EQUAL(int_, 5, a, (0, 1, 2, 3, 4));

    compute::vector<int_>::iterator iter =
        compute::adjacent_difference(a.begin(), a.end(), a.begin(), queue);
    BOOST_CHECK(iter == a.end());
    CHECK_RANGE_EQUAL(int_, 5, a, (0, 1, 1, 1, 1));
}

BOOST_AUTO_TEST_CASE(all_same)
{
    using compute::int_;

    compute::vector<int_> input(1000, context);
    compute::fill(input.begin(), input.end(), 42, queue);

    compute::vector<int_> output(input.size(), context);

    compute::adjacent_difference(
        input.begin(), input.end(), output.begin(), queue
    );

    int_ first;
    compute::copy_n(output.begin(), 1, &first, queue);
    BOOST_CHECK_EQUAL(first, 42);

    using compute::lambda::_1;

    BOOST_CHECK(
        compute::all_of(output.begin() + 1, output.end(), _1 == 0, queue)
    );
}

BOOST_AUTO_TEST_SUITE_END()