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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
|
#include "vtkAbstractArray.h"
#include "vtkDoubleArray.h"
#include "vtkIntArray.h"
#include "vtkNew.h"
#include "vtkStringArray.h"
#include "vtkVariantArray.h"
static double testTuplesDouble[] = {
// A simple test where every component *and* the
// tuples as a whole behave discretely.
0., 0., 1.,
1., 0., 3.,
0., 2., 7.,
0., 0., 9.,
1., 0., 1.,
0., 2., 8.,
};
// Bounds on the number of unique values that should be identified.
// For larger data, the number may not be precise
// as we sample subsets of the data.
static int numUniqueDouble[] = {
2, 2,
2, 2,
5, 5,
6, 6,
};
static int testTuplesInt[] = {
/*
These next tuples repeat 16 coordinate values but are frequently not
identical in both components to other tuples. Thus the components
should have 16 discrete values reported, but the vectors as
a whole should not since there are 43 distinct tuples.
Furthermore, the array is sampled as opposed to exhastively enumerated
and so only 15 unique values are detected for component 1.
*/
16, 1,
8, 14,
10, 3,
11, 4,
2, 13,
7, 12,
6, 5,
15, 9,
15, 6,
9, 7,
11, 16,
1, 5,
2, 3,
13, 12,
4, 8,
14, 10,
4, 14,
11, 9,
7, 3,
8, 2,
12, 13,
1, 6,
15, 10,
16, 5,
4, 10,
12, 3,
5, 8,
13, 1,
14, 11,
2, 6,
15, 9,
7, 16,
1, 2,
5, 3,
16, 13,
15, 9,
11, 12,
7, 14,
8, 10,
4, 6,
8, 13,
16, 14,
15, 2,
11, 1,
3, 10,
4, 6,
7, 12,
5, 9,
};
static int numUniqueInt[] = {
1, 16,
1, 16,
0, 0,
};
static int testTuplesInt2[] = {
// There are no repeats in this set.
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,
};
static int numUniqueInt2[] = {
0, 0,
};
static vtkStdString testTuplesString[] = {
/*
To test the log(N) sampling strategy, we must
have a large number of entries in the array.
The 4 words marked "not detected" below are placed to leave them
intentionally undetected on at least one platform.
The vtkObject ModificationTime counter is used as a
seed for the random number generator and its count
will vary across platforms and compile-time options,
so we accept anywhere from 4 to 8 values being detected
when subsampling. This data is used twice: once forcing all
tuples to be sampled and once using subsampling.
*/
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Skeenie", "Beeny", "Piny", "Po", "Po", // not detected.
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
"Eeny", "Meeny", "Miny", "Mo", "Miny",
};
static int numUniqueStringComplete[2] = {
8, 8,
};
static int numUniqueStringSubset[2] = {
4, 8,
};
static bool CheckUniques(
vtkAbstractArray* arr, int* uniqueSizeBds,
double uncertainty, double minProminence)
{
bool ok = true;
if (!arr)
{
return ok;
}
cout << arr->GetName() << endl;
int nc = arr->GetNumberOfComponents();
vtkNew<vtkVariantArray> uniques;
for (int c = 0; c < nc; ++c)
{
arr->GetProminentComponentValues(
c, uniques.GetPointer(), uncertainty, minProminence);
int numUniques = static_cast<int>(uniques->GetNumberOfTuples());
cout << " comp " << c << " (" << numUniques << "): ";
for (int n = 0; n <= uniques->GetMaxId(); ++n)
{
cout
<< (n > 0 ? ", " : " ")
<< uniques->GetVariantValue(n).ToString().c_str();
}
cout << endl;
if (
uniqueSizeBds[2 * c] > numUniques ||
uniqueSizeBds[2 * c + 1] < numUniques)
{
cout
<< " ** ERROR: Expected between " << uniqueSizeBds[2 * c]
<< " and " << uniqueSizeBds[2 * c + 1] << " values\n";
ok = false;
}
}
if (nc > 1)
{
arr->GetProminentComponentValues(
-1, uniques.GetPointer(), uncertainty, minProminence);
int numUniques = static_cast<int>(uniques->GetNumberOfTuples());
cout << " tuples (" << numUniques << "): ";
for (int n = 0; n <= uniques->GetMaxId(); ++n)
{
cout
<< (n > 0 && n % nc == 0 ? ", " : " ")
<< uniques->GetVariantValue(n).ToString().c_str();
}
cout << endl;
if (
uniqueSizeBds[2 * nc] > numUniques ||
uniqueSizeBds[2 * nc + 1] < numUniques)
{
cout
<< " ** ERROR: Expected between " << uniqueSizeBds[2 * nc]
<< " and " << uniqueSizeBds[2 * nc + 1] << " values\n";
ok = false;
}
}
return ok;
}
int TestArrayUniqueValueDetection(int vtkNotUsed(argc), char* vtkNotUsed(argv)[])
{
bool ok = true;
vtkNew<vtkDoubleArray> darr;
vtkNew<vtkIntArray> iarr;
vtkNew<vtkStringArray> sarr;
darr->SetNumberOfComponents(3);
darr->SetArray(testTuplesDouble,
sizeof(testTuplesDouble)/sizeof(testTuplesDouble[0]), 1);
darr->SetName("Some3DPoints - Show off distinct tuple detection");
ok &= CheckUniques(darr.GetPointer(), numUniqueDouble, 0., 0.);
iarr->SetNumberOfComponents(2);
iarr->SetArray(testTuplesInt,
sizeof(testTuplesInt)/sizeof(testTuplesInt[0]), 1);
iarr->SetName("Some2DPoints - Show off tuple non-detection");
ok &= CheckUniques(iarr.GetPointer(), numUniqueInt, 0., 0.);
iarr->SetNumberOfComponents(1);
iarr->SetArray(testTuplesInt2,
sizeof(testTuplesInt2)/sizeof(testTuplesInt2[0]), 1);
//iarr->Modified(); // required since we have changed the tuples?
iarr->SetName("Some1DPoints - Show off component non-detection");
ok &= CheckUniques(iarr.GetPointer(), numUniqueInt2, 0., 0.);
sarr->SetNumberOfComponents(1);
sarr->SetArray(testTuplesString,
sizeof(testTuplesString)/sizeof(testTuplesString[0]), 1);
sarr->SetName("SomeNonWords - Show off string value detection");
ok &= CheckUniques(sarr.GetPointer(), numUniqueStringComplete, 0.0, 0.0);
sarr->Modified(); // Verify that modifying the array causes a re-compute
sarr->SetName("SomeNonWords - Show off non-exhaustive search");
ok &= CheckUniques(sarr.GetPointer(), numUniqueStringSubset, 0.5, 0.1);
return ok ? 0 : 1;
}
|
