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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
// SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
// SPDX-FileContributor: 2003-22 Bradley M. Bell
// ----------------------------------------------------------------------------
# include <cppad/cppad.hpp>
namespace { // BEGIN empty namespace
template <class SetVector>
bool test_no_other(void)
{ bool ok = true;
SetVector vec_set;
size_t n_set = 4;
size_t end = 5;
//
// set size of vec_set
vec_set.resize(n_set, end);
ok &= end == vec_set.end();
ok &= n_set == vec_set.n_set();
//
// test resizing to zero
vec_set.resize(0, 0);
ok &= 0 == vec_set.n_set();
ok &= 0 == vec_set.end();
//
// set size of vec_set
vec_set.resize(n_set, end);
ok &= end == vec_set.end();
ok &= n_set == vec_set.n_set();
//
// add the element i+1 to set i
for(size_t i = 1; i < n_set; i++)
vec_set.add_element(i, i+1);
//
// check for element i and i+1 in set i
for(size_t i = 0; i < n_set; i++)
{ ok &= ! vec_set.is_element(i, i);
if( i == 0 )
ok &= ! vec_set.is_element(i, i+1);
else
ok &= vec_set.is_element(i, i+1);
}
//
// set an empty set to value of set 2
size_t target = 0;
size_t source = 2;
vec_set.assignment(target, source, vec_set);
ok &= ! vec_set.is_element(target, source);
ok &= vec_set.is_element(target, source+1);
//
// set a non-empty set to the value of set 2
target = 1;
vec_set.assignment(target, source, vec_set);
ok &= ! vec_set.is_element(target, source);
ok &= vec_set.is_element(target, source+1);
//
// add an element to set 1, one of the three vectors equal to set 2
target = 1;
vec_set.add_element(target, source);
ok &= vec_set.is_element(target, source);
ok &= vec_set.is_element(target, source+1);
ok &= ! vec_set.is_element(source, source);
ok &= vec_set.is_element(source, source+1);
//
// now take the union of set 2 and set 3 and place in set 0
// (which is sharing a list with set 2)
target = 0;
vec_set.binary_union(target, source, source+1, vec_set);
ok &= vec_set.is_element(target, source+1);
ok &= vec_set.is_element(target, source+2);
ok &= vec_set.is_element(source, source+1);
ok &= ! vec_set.is_element(source, source+2);
//
// now check the elements in set 0 by iterating over them
typename SetVector::const_iterator itr(vec_set, target);
ok &= *itr == source+1;
ok &= *(++itr) == source+2;
ok &= *(++itr) == end;
//
// now test clear
vec_set.clear(1);
ok &= ! vec_set.is_element(1, source+1);
ok &= vec_set.is_element(0, source+1);
//
// now force list_setvec garbage collection by setting all sets
// equal to set 0
for(size_t i = 1; i < n_set; i++)
{ vec_set.assignment(i, 0, vec_set);
ok &= vec_set.is_element(i, source+1);
ok &= vec_set.is_element(i, source+2);
}
//
return ok;
}
template <class SetVector>
bool test_yes_other(void)
{ bool ok = true;
SetVector vec_set, other_vec;
size_t n_set = 4;
size_t end = 5;
vec_set.resize(n_set, end);
other_vec.resize(n_set, end);
//
// add element i to set i in vec_set
// add element i+1 to set i in other
for(size_t i = 1; i < n_set; i++)
{ vec_set.add_element(i, i);
other_vec.add_element(i, i+1);
}
//
// assignment of one set from other
size_t target = 0;
size_t source = 1;
vec_set.assignment(target, source, other_vec);
ok &= ! vec_set.is_element(target, source);
ok &= vec_set.is_element(target, source+1);
//
// now take the union of a set from vec_set and from other_vec
target = 2; // where result goes in vec_set
size_t left = 2; // left operand in vec_set
size_t right = 2; // right operand in other
vec_set.binary_union(target, left, right, other_vec);
ok &= vec_set.is_element(target, left);
ok &= vec_set.is_element(target, right+1);
//
// now use assignment for entire vector of sets
vec_set = other_vec;
ok &= ! vec_set.is_element(0, 0);
ok &= ! vec_set.is_element(0, 1);
for(size_t i = 1; i < n_set; i++)
{ ok &= ! vec_set.is_element(i, i);
ok &= vec_set.is_element(i, i+1);
}
return ok;
}
template <class SetVector>
bool test_intersection(void)
{ bool ok = true;
//
SetVector vec_set;
size_t n_set = 3;
size_t end = 5;
vec_set.resize(n_set, end);
//
// set[0] = {1, 2}
vec_set.add_element(0, 1);
vec_set.add_element(0, 2);
//
// set[1] = {2, 3}
vec_set.add_element(1, 2);
vec_set.add_element(1, 3);
//
// set[2] = set[0] intersect set[1]
size_t target = 2;
size_t left = 0;
size_t right = 1;
vec_set.binary_intersection(target, left, right, vec_set);
//
typename SetVector::const_iterator itr1(vec_set, target);
ok &= *itr1 == 2;
ok &= *(++itr1) == end;
//
// other[1] = set[1]
SetVector other;
other.resize(n_set, end);
target = 1;
size_t source = 1;
other.assignment(target, source, vec_set);
//
// set[2] = set[0] intersect other[1]
target = 2;
left = 0;
right = 1;
vec_set.binary_intersection(target, left, right, other);
//
typename SetVector::const_iterator itr2(vec_set, target);
ok &= *itr2 == 2;
ok &= *(++itr2) == end;
//
return ok;
}
template<class SetVector>
bool test_post(void)
{ bool ok = true;
//
SetVector vec_set;
size_t n_set = 3;
size_t end = 5;
vec_set.resize(n_set, end);
//
// set[1] = {1, 2}
vec_set.add_element(1, 1);
vec_set.add_element(1, 2);
//
// set[1] = {1, 2} union (2, 4, 4) = {1, 2, 4}
size_t target = 1;
vec_set.post_element(target, 2);
vec_set.post_element(target, 4);
vec_set.post_element(target, 4);
vec_set.process_post(target);
//
typename SetVector::const_iterator itr1(vec_set, target);
ok &= *itr1 == 1;
ok &= *(++itr1) == 2;
ok &= *(++itr1) == 4;
ok &= *(++itr1) == end;
//
// set[1] = {1, 2, 4} union (1, 2)
target = 1;
vec_set.post_element(target, 1);
vec_set.post_element(target, 2);
vec_set.process_post(target);
//
typename SetVector::const_iterator itr2(vec_set, target);
ok &= *itr2 == 1;
ok &= *(++itr2) == 2;
ok &= *(++itr2) == 4;
ok &= *(++itr2) == end;
//
return ok;
}
} // END empty namespace
bool vector_set(void)
{ bool ok = true;
//
ok &= test_no_other<CppAD::local::sparse::pack_setvec>();
ok &= test_no_other<CppAD::local::sparse::list_setvec>();
ok &= test_no_other<CppAD::local::sparse::svec_setvec>();
//
ok &= test_yes_other<CppAD::local::sparse::pack_setvec>();
ok &= test_yes_other<CppAD::local::sparse::list_setvec>();
ok &= test_yes_other<CppAD::local::sparse::svec_setvec>();
//
ok &= test_intersection<CppAD::local::sparse::pack_setvec>();
ok &= test_intersection<CppAD::local::sparse::list_setvec>();
ok &= test_intersection<CppAD::local::sparse::svec_setvec>();
//
ok &= test_post<CppAD::local::sparse::pack_setvec>();
ok &= test_post<CppAD::local::sparse::list_setvec>();
# ifdef CPPAD_DO_NOT_RUN_THIS_TEST
// 2DO: This class tested below is not currently being used.
// This test is failing due to a bug. To be specific, push_back on a vector
// is invalidating some pointers.
// We need to use a different temporary vector for these push_backs.
ok &= test_post<CppAD::local::sparse::svec_setvec>();
# endif
//
return ok;
}
|
