forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkIdList.cxx
274 lines (240 loc) · 6.51 KB
/
vtkIdList.cxx
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
/*=========================================================================
Program: Visualization Toolkit
Module: vtkIdList.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "vtkIdList.h"
#include "vtkObjectFactory.h"
#include "vtkSMPTools.h" //for parallel sort
vtkStandardNewMacro(vtkIdList);
//------------------------------------------------------------------------------
vtkIdList::vtkIdList()
{
this->NumberOfIds = 0;
this->Size = 0;
this->Ids = nullptr;
}
//------------------------------------------------------------------------------
vtkIdList::~vtkIdList()
{
delete[] this->Ids;
}
//------------------------------------------------------------------------------
vtkIdType* vtkIdList::Release()
{
auto retval = this->Ids;
this->Ids = nullptr;
this->Initialize();
return retval;
}
//------------------------------------------------------------------------------
void vtkIdList::Initialize()
{
delete[] this->Ids;
this->Ids = nullptr;
this->NumberOfIds = 0;
this->Size = 0;
}
//------------------------------------------------------------------------------
int vtkIdList::Allocate(const vtkIdType sz, const int vtkNotUsed(strategy))
{
if (sz > this->Size)
{
this->Initialize();
this->Size = (sz > 0 ? sz : 1);
if ((this->Ids = new vtkIdType[this->Size]) == nullptr)
{
return 0;
}
}
this->NumberOfIds = 0;
return 1;
}
//------------------------------------------------------------------------------
void vtkIdList::SetNumberOfIds(const vtkIdType number)
{
this->Allocate(number, 0);
this->NumberOfIds = number;
}
//------------------------------------------------------------------------------
vtkIdType vtkIdList::InsertUniqueId(const vtkIdType vtkid)
{
for (vtkIdType i = 0; i < this->NumberOfIds; i++)
{
if (vtkid == this->Ids[i])
{
return i;
}
}
return this->InsertNextId(vtkid);
}
//------------------------------------------------------------------------------
vtkIdType* vtkIdList::WritePointer(const vtkIdType i, const vtkIdType number)
{
vtkIdType newSize = i + number;
if (newSize > this->Size)
{
this->Resize(newSize);
}
if (newSize > this->NumberOfIds)
{
this->NumberOfIds = newSize;
}
return this->Ids + i;
}
//------------------------------------------------------------------------------
void vtkIdList::SetArray(vtkIdType* array, vtkIdType size)
{
delete[] this->Ids;
this->Ids = array;
this->NumberOfIds = size;
this->Size = size;
}
//------------------------------------------------------------------------------
void vtkIdList::DeleteId(vtkIdType vtkid)
{
vtkIdType i = 0;
// while loop is necessary to delete all occurrences of vtkid
while (i < this->NumberOfIds)
{
for (; i < this->NumberOfIds; i++)
{
if (this->Ids[i] == vtkid)
{
break;
}
}
// if found; replace current id with last
if (i < this->NumberOfIds)
{
this->SetId(i, this->Ids[this->NumberOfIds - 1]);
this->NumberOfIds--;
}
}
}
//------------------------------------------------------------------------------
void vtkIdList::DeepCopy(vtkIdList* ids)
{
this->SetNumberOfIds(ids->NumberOfIds);
if (ids->NumberOfIds > 0)
{
std::copy(ids->Ids, ids->Ids + ids->NumberOfIds, this->Ids);
}
this->Squeeze();
}
//------------------------------------------------------------------------------
vtkIdType* vtkIdList::Resize(const vtkIdType sz)
{
vtkIdType* newIds;
vtkIdType newSize;
if (sz > this->Size)
{
newSize = this->Size + sz;
}
else if (sz == this->Size)
{
return this->Ids;
}
else
{
newSize = sz;
}
if (newSize <= 0)
{
this->Initialize();
return nullptr;
}
if ((newIds = new vtkIdType[newSize]) == nullptr)
{
vtkErrorMacro(<< "Cannot allocate memory\n");
return nullptr;
}
if (this->NumberOfIds > newSize)
{
this->NumberOfIds = newSize;
}
if (this->Ids)
{
memcpy(newIds, this->Ids,
static_cast<size_t>(sz < this->Size ? sz : this->Size) * sizeof(vtkIdType));
delete[] this->Ids;
}
this->Size = newSize;
this->Ids = newIds;
return this->Ids;
}
//------------------------------------------------------------------------------
#define VTK_TMP_ARRAY_SIZE 500
// Intersect this list with another vtkIdList. Updates current list according
// to result of intersection operation.
void vtkIdList::IntersectWith(vtkIdList* otherIds)
{
// Fast method due to Dr. Andreas Mueller of ISE Integrated Systems
// Engineering (CH).
vtkIdType thisNumIds = this->GetNumberOfIds();
if (thisNumIds <= VTK_TMP_ARRAY_SIZE)
{ // Use fast method if we can fit in temporary storage
vtkIdType thisIds[VTK_TMP_ARRAY_SIZE];
vtkIdType i, vtkid;
for (i = 0; i < thisNumIds; i++)
{
thisIds[i] = this->GetId(i);
}
for (this->Reset(), i = 0; i < thisNumIds; i++)
{
vtkid = thisIds[i];
if (otherIds->IsId(vtkid) != (-1))
{
this->InsertNextId(vtkid);
}
}
}
else
{ // use slower method for extreme cases
vtkIdType* thisIds = new vtkIdType[thisNumIds];
vtkIdType i, vtkid;
for (i = 0; i < thisNumIds; i++)
{
*(thisIds + i) = this->GetId(i);
}
for (this->Reset(), i = 0; i < thisNumIds; i++)
{
vtkid = *(thisIds + i);
if (otherIds->IsId(vtkid) != (-1))
{
this->InsertNextId(vtkid);
}
}
delete[] thisIds;
}
}
#undef VTK_TMP_ARRAY_SIZE
//------------------------------------------------------------------------------
void vtkIdList::Sort()
{
if (this->Ids == nullptr || this->NumberOfIds < 2)
{
return;
}
vtkSMPTools::Sort(this->Ids, this->Ids + this->NumberOfIds);
}
//------------------------------------------------------------------------------
void vtkIdList::Fill(vtkIdType value)
{
if (this->Ids == nullptr || this->NumberOfIds < 1)
{
return;
}
vtkSMPTools::Fill(this->Ids, this->Ids + this->NumberOfIds, value);
}
//------------------------------------------------------------------------------
void vtkIdList::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "Number of Ids: " << this->NumberOfIds << "\n";
}