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
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
#include "vtkCollection.h"
#include "vtkCollectionRange.h"
#include "vtkIntArray.h"
#include "vtkNew.h"
#include "vtkSmartPointer.h"
#include <algorithm>
bool TestRegister();
bool TestRemoveItem(int index, bool removeIndex);
int TestCollection(int, char*[])
{
bool res = true;
res = TestRegister() && res;
res = TestRemoveItem(0, false) && res;
res = TestRemoveItem(1, false) && res;
res = TestRemoveItem(5, false) && res;
res = TestRemoveItem(8, false) && res;
res = TestRemoveItem(9, false) && res;
res = TestRemoveItem(0, true) && res;
res = TestRemoveItem(1, true) && res;
res = TestRemoveItem(5, true) && res;
res = TestRemoveItem(8, true) && res;
res = TestRemoveItem(9, true) && res;
return res ? EXIT_SUCCESS : EXIT_FAILURE;
}
static bool IsEqualRange(
vtkCollection* collection, const std::vector<vtkSmartPointer<vtkIntArray>>& v)
{
const auto range = vtk::Range(collection);
if (range.size() != static_cast<int>(v.size()))
{
std::cerr << "Range size invalid.\n";
return false;
}
// Test C++11 for-range interop
auto vecIter = v.begin();
for (auto item : range)
{
if (item != vecIter->GetPointer())
{
std::cerr << "Range iterator returned unexpected value.\n";
return false;
}
++vecIter;
}
return true;
}
static bool IsEqual(vtkCollection* collection, const std::vector<vtkSmartPointer<vtkIntArray>>& v)
{
if (collection->GetNumberOfItems() != static_cast<int>(v.size()))
{
return false;
}
vtkIntArray* dataArray = nullptr;
vtkCollectionSimpleIterator it;
int i = 0;
for (collection->InitTraversal(it);
(dataArray = vtkIntArray::SafeDownCast(collection->GetNextItemAsObject(it))); ++i)
{
if (v[i] != dataArray)
{
return false;
}
}
return IsEqualRange(collection, v); // test range iterators, too.
}
bool TestRegister()
{
vtkNew<vtkCollection> collection;
vtkIntArray* object = vtkIntArray::New();
collection->AddItem(object);
object->Delete();
if (object->GetReferenceCount() != 1)
{
std::cout << object->GetReferenceCount() << std::endl;
return false;
}
object->Register(nullptr);
collection->RemoveItem(object);
if (object->GetReferenceCount() != 1)
{
std::cout << object->GetReferenceCount() << std::endl;
return false;
}
object->UnRegister(nullptr);
return true;
}
bool TestRemoveItem(int index, bool removeIndex)
{
vtkNew<vtkCollection> collection;
std::vector<vtkSmartPointer<vtkIntArray>> objects;
for (int i = 0; i < 10; ++i)
{
vtkNew<vtkIntArray> object;
collection->AddItem(object);
objects.emplace_back(object.GetPointer());
}
if (removeIndex)
{
collection->RemoveItem(index);
}
else
{
vtkObject* objectToRemove = objects[index];
collection->RemoveItem(objectToRemove);
}
objects.erase(objects.begin() + index);
if (!IsEqual(collection, objects))
{
std::cout << "TestRemoveItem failed:" << std::endl;
collection->Print(std::cout);
return false;
}
return true;
}
|
