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
|
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
// SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
// SPDX-FileContributor: 2003-24 Bradley M. Bell
// ----------------------------------------------------------------------------
// CppAD::vector tests
# include <cppad/utility/vector.hpp>
# include <vector>
# include <algorithm>
namespace { // BEGIN_EMPTY_NAMESPACE
bool test_find(void)
{ // find requires an input iterator
bool ok = true;
typedef CppAD::vector<char>::const_iterator const_iterator;
//
size_t n = 10;
CppAD::vector<char> vec(n);
for(size_t i = 0; i < n; ++i)
vec[i] = static_cast<char>( '0' + i);
const_iterator itr;
//
itr = std::find(vec.begin(), vec.end(), '3');
ok &= itr != vec.end();
ok &= *itr == '3';
//
itr = std::find(vec.begin(), vec.end(), 'a');
ok &= itr == vec.end();
//
return ok;
}
bool test_copy(void)
{ // copy requires a forward iterator
bool ok = true;
//
size_t n = 10;
CppAD::vector<char> vec(n), des(n);
for(size_t i = 0; i < n; ++i)
vec[i] = static_cast<char>( '0' + i);
const CppAD::vector<char> src(vec);
//
// src.begin(), src.end() are const_iterator
// des.begin() is an iterator
std::copy(src.begin(), src.end(), des.begin());
//
for(size_t i = 0; i < n; ++i)
ok &= src[i] == des[i];
//
return ok;
}
bool test_reverse(void)
{ // copy requires a bidirectional iterator
bool ok = true;
//
size_t n = 10;
CppAD::vector<char> src(n), des(n);
for(size_t i = 0; i < n; ++i)
src[i] = static_cast<char>( '0' + i);
//
std::reverse(src.begin(), src.end());
//
for(size_t i = 0; i < n; ++i)
ok &= src[i] == static_cast<char>( '0' + (n - i - 1) );
//
return ok;
}
bool test_sort(void)
{ // copy requires a random access iterator
bool ok = true;
//
size_t n = 10;
CppAD::vector<char> vec(n);
for(size_t i = 0; i < n; ++i)
vec[i] = static_cast<char>( '0' + (n - i - 1) );
//
std::sort(vec.begin(), vec.end());
//
for(size_t i = 0; i < n; ++i)
ok &= vec[i] == static_cast<char>( '0' + i );
//
return ok;
}
} // END_EMPTY_NAMESPACE
bool cppad_vector(void)
{ bool ok = true;
//
ok &= test_find();
ok &= test_copy();
ok &= test_reverse();
ok &= test_sort();
//
return ok;
}
|
