Spaces:
Runtime error
Runtime error
File size: 3,398 Bytes
be11144 |
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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 |
#include <unittest/unittest.h>
#include <thrust/sort.h>
#include <thrust/iterator/retag.h>
template<typename Vector>
void TestIsSortedUntilSimple(void)
{
typedef typename Vector::value_type T;
typedef typename Vector::iterator Iterator;
Vector v(4);
v[0] = 0; v[1] = 5; v[2] = 8; v[3] = 0;
Iterator first = v.begin();
Iterator last = v.begin() + 0;
Iterator ref = last;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last));
last = v.begin() + 1;
ref = last;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last));
last = v.begin() + 2;
ref = last;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last));
last = v.begin() + 3;
ref = v.begin() + 3;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last));
last = v.begin() + 4;
ref = v.begin() + 3;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last));
last = v.begin() + 3;
ref = v.begin() + 3;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last, thrust::less<T>()));
last = v.begin() + 4;
ref = v.begin() + 3;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last, thrust::less<T>()));
last = v.begin() + 1;
ref = v.begin() + 1;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last, thrust::greater<T>()));
last = v.begin() + 4;
ref = v.begin() + 1;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last, thrust::greater<T>()));
first = v.begin() + 2;
last = v.begin() + 4;
ref = v.begin() + 4;
ASSERT_EQUAL_QUIET(ref, thrust::is_sorted_until(first, last, thrust::greater<T>()));
}
DECLARE_VECTOR_UNITTEST(TestIsSortedUntilSimple);
template<typename Vector>
void TestIsSortedUntilRepeatedElements(void)
{
Vector v(10);
v[0] = 0;
v[1] = 1;
v[2] = 1;
v[3] = 2;
v[4] = 3;
v[5] = 4;
v[6] = 5;
v[7] = 5;
v[8] = 5;
v[9] = 6;
ASSERT_EQUAL_QUIET(v.end(), thrust::is_sorted_until(v.begin(), v.end()));
}
DECLARE_VECTOR_UNITTEST(TestIsSortedUntilRepeatedElements);
template <class Vector>
void TestIsSortedUntil(void)
{
typedef typename Vector::value_type T;
const size_t n = (1 << 16) + 13;
Vector v = unittest::random_integers<T>(n);
v[0] = 1;
v[1] = 0;
ASSERT_EQUAL_QUIET(v.begin() + 1, thrust::is_sorted_until(v.begin(), v.end()));
thrust::sort(v.begin(), v.end());
ASSERT_EQUAL_QUIET(v.end(), thrust::is_sorted_until(v.begin(), v.end()));
}
DECLARE_INTEGRAL_VECTOR_UNITTEST(TestIsSortedUntil);
template<typename ForwardIterator>
ForwardIterator is_sorted_until(my_system &system, ForwardIterator first, ForwardIterator)
{
system.validate_dispatch();
return first;
}
void TestIsSortedUntilExplicit()
{
thrust::device_vector<int> vec(1);
my_system sys(0);
thrust::is_sorted_until(sys, vec.begin(), vec.end());
ASSERT_EQUAL(true, sys.is_valid());
}
DECLARE_UNITTEST(TestIsSortedUntilExplicit);
template<typename ForwardIterator>
ForwardIterator is_sorted_until(my_tag, ForwardIterator first, ForwardIterator)
{
*first = 13;
return first;
}
void TestIsSortedUntilImplicit()
{
thrust::device_vector<int> vec(1);
thrust::is_sorted_until(thrust::retag<my_tag>(vec.begin()),
thrust::retag<my_tag>(vec.end()));
ASSERT_EQUAL(13, vec.front());
}
DECLARE_UNITTEST(TestIsSortedUntilImplicit);
|