20
20
21
21
vtkStandardNewMacro (vtkEdgeTable);
22
22
23
+ // ----------------------------------------------------------------------------
23
24
// Instantiate object based on maximum point id.
24
25
vtkEdgeTable::vtkEdgeTable ()
25
26
{
@@ -36,6 +37,7 @@ vtkEdgeTable::vtkEdgeTable()
36
37
this ->NumberOfEdges = 0 ;
37
38
}
38
39
40
+ // ----------------------------------------------------------------------------
39
41
// Free memory and return to instantiated state.
40
42
void vtkEdgeTable::Initialize ()
41
43
{
@@ -90,6 +92,7 @@ void vtkEdgeTable::Initialize()
90
92
this ->NumberOfEdges = 0 ;
91
93
}
92
94
95
+ // ----------------------------------------------------------------------------
93
96
// Free memory and return to instantiated state.
94
97
void vtkEdgeTable::Reset ()
95
98
{
@@ -137,11 +140,13 @@ void vtkEdgeTable::Reset()
137
140
this ->NumberOfEdges = 0 ;
138
141
}
139
142
143
+ // ----------------------------------------------------------------------------
140
144
vtkEdgeTable::~vtkEdgeTable ()
141
145
{
142
146
this ->Initialize ();
143
147
}
144
148
149
+ // ----------------------------------------------------------------------------
145
150
int vtkEdgeTable::InitEdgeInsertion (vtkIdType numPoints, int storeAttributes)
146
151
{
147
152
vtkIdType i;
@@ -194,6 +199,7 @@ int vtkEdgeTable::InitEdgeInsertion(vtkIdType numPoints, int storeAttributes)
194
199
return 1 ;
195
200
}
196
201
202
+ // ----------------------------------------------------------------------------
197
203
// Return non-negative if edge (p1,p2) is an edge; otherwise -1.
198
204
vtkIdType vtkEdgeTable::IsEdge (vtkIdType p1, vtkIdType p2)
199
205
{
@@ -235,6 +241,7 @@ vtkIdType vtkEdgeTable::IsEdge(vtkIdType p1, vtkIdType p2)
235
241
}
236
242
}
237
243
244
+ // ----------------------------------------------------------------------------
238
245
// Return non-negative if edge (p1,p2) is an edge; otherwise -1.
239
246
void vtkEdgeTable::IsEdge (vtkIdType p1, vtkIdType p2, void * &ptr)
240
247
{
@@ -276,6 +283,7 @@ void vtkEdgeTable::IsEdge(vtkIdType p1, vtkIdType p2, void* &ptr)
276
283
}
277
284
}
278
285
286
+ // ----------------------------------------------------------------------------
279
287
// Insert the edge (p1,p2) into the table. It is the user's responsibility to
280
288
// check if the edge has already been inserted.
281
289
vtkIdType vtkEdgeTable::InsertEdge (vtkIdType p1, vtkIdType p2)
@@ -328,6 +336,7 @@ vtkIdType vtkEdgeTable::InsertEdge(vtkIdType p1, vtkIdType p2)
328
336
return (this ->NumberOfEdges - 1 );
329
337
}
330
338
339
+ // ----------------------------------------------------------------------------
331
340
void vtkEdgeTable::InsertEdge (vtkIdType p1, vtkIdType p2,
332
341
vtkIdType attributeId)
333
342
{
@@ -373,6 +382,7 @@ void vtkEdgeTable::InsertEdge(vtkIdType p1, vtkIdType p2,
373
382
}
374
383
}
375
384
385
+ // ----------------------------------------------------------------------------
376
386
void vtkEdgeTable::InsertEdge (vtkIdType p1, vtkIdType p2, void * ptr)
377
387
{
378
388
vtkIdType index, search;
@@ -418,6 +428,7 @@ void vtkEdgeTable::InsertEdge(vtkIdType p1, vtkIdType p2, void* ptr)
418
428
}
419
429
420
430
431
+ // ----------------------------------------------------------------------------
421
432
// Intialize traversal of edges in table.
422
433
void vtkEdgeTable::InitTraversal ()
423
434
{
@@ -445,14 +456,15 @@ vtkIdType vtkEdgeTable::GetNextEdge(vtkIdType &p1, vtkIdType &p2)
445
456
}
446
457
else
447
458
{
448
- return (-1 );
459
+ return (-1 );
449
460
}
450
461
}
451
462
}
452
463
453
464
return (-1 );
454
465
}
455
466
467
+ // ----------------------------------------------------------------------------
456
468
// Traverse list of edges in table. Return the edge as (p1,p2), where p1 and
457
469
// p2 are point id's. The value of p1 is guaranteed to be <= p2. The
458
470
// return value is either 1 for success or 0 if the list is exhausted.
@@ -541,6 +553,7 @@ vtkIdList **vtkEdgeTable::Resize(vtkIdType sz)
541
553
return this ->Table ;
542
554
}
543
555
556
+ // ----------------------------------------------------------------------------
544
557
int vtkEdgeTable::InitPointInsertion (vtkPoints *newPts, vtkIdType estSize)
545
558
{
546
559
// Initialize
@@ -566,6 +579,7 @@ int vtkEdgeTable::InitPointInsertion(vtkPoints *newPts, vtkIdType estSize)
566
579
return 1 ;
567
580
}
568
581
582
+ // ----------------------------------------------------------------------------
569
583
int vtkEdgeTable::InsertUniquePoint (vtkIdType p1, vtkIdType p2, double x[3 ],
570
584
vtkIdType &ptId)
571
585
{
@@ -584,6 +598,7 @@ int vtkEdgeTable::InsertUniquePoint(vtkIdType p1, vtkIdType p2, double x[3],
584
598
}
585
599
}
586
600
601
+ // ----------------------------------------------------------------------------
587
602
void vtkEdgeTable::PrintSelf (ostream& os, vtkIndent indent)
588
603
{
589
604
this ->Superclass ::PrintSelf (os,indent);
0 commit comments