File: test_adjacent_find.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 (68 lines) | stat: -rw-r--r-- 2,086 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
//---------------------------------------------------------------------------//
// 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 TestAdjacentFind
#include <boost/test/unit_test.hpp>

#include <boost/compute/command_queue.hpp>
#include <boost/compute/algorithm/adjacent_find.hpp>
#include <boost/compute/algorithm/fill.hpp>
#include <boost/compute/algorithm/iota.hpp>
#include <boost/compute/container/vector.hpp>

#include "context_setup.hpp"

namespace compute = boost::compute;

BOOST_AUTO_TEST_CASE(adjacent_find_int)
{
    int data[] = { 1, 3, 5, 5, 6, 7, 7, 8 };
    compute::vector<int> vec(data, data + 8, queue);

    compute::vector<int>::iterator iter =
        compute::adjacent_find(vec.begin(), vec.end(), queue);
    BOOST_CHECK(iter == vec.begin() + 2);
}

BOOST_AUTO_TEST_CASE(adjacent_find_int2)
{
    using compute::int2_;

    compute::vector<int2_> vec(context);
    vec.push_back(int2_(1, 2), queue);
    vec.push_back(int2_(3, 4), queue);
    vec.push_back(int2_(5, 6), queue);
    vec.push_back(int2_(7, 8), queue);
    vec.push_back(int2_(7, 8), queue);

    compute::vector<int2_>::iterator iter =
        compute::adjacent_find(vec.begin(), vec.end(), queue);
    BOOST_CHECK(iter == vec.begin() + 3);
}

BOOST_AUTO_TEST_CASE(adjacent_find_iota)
{
    compute::vector<int> vec(2048, context);
    compute::iota(vec.begin(), vec.end(), 1, queue);
    BOOST_VERIFY(
        compute::adjacent_find(vec.begin(), vec.end(), queue) == vec.end()
    );
}

BOOST_AUTO_TEST_CASE(adjacent_find_fill)
{
    compute::vector<int> vec(2048, context);
    compute::fill(vec.begin(), vec.end(), 7, queue);
    BOOST_VERIFY(
        compute::adjacent_find(vec.begin(), vec.end(), queue) == vec.begin()
    );
}

BOOST_AUTO_TEST_SUITE_END()