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
|
/*=========================================================================
Copyright (c) Kitware, Inc.
All rights reserved.
See Copyright.txt or http://www.kitware.com/VolViewCopyright.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 blockers needed since vtkVector.h includes this file
// when VTK_NO_EXPLICIT_TEMPLATE_INSTANTIATION is defined.
#ifndef __vtkLinkedListIterator_txx
#define __vtkLinkedListIterator_txx
#include "vtkLinkedListIterator.h"
#include "vtkAbstractIterator.txx"
#include "vtkLinkedList.h"
template <class DType>
vtkLinkedListIterator<DType> *vtkLinkedListIterator<DType>::New()
{
#ifdef VTK_DEBUG_LEAKS
vtkDebugLeaks::ConstructClass("vtkLinkedListIterator");
#endif
return new vtkLinkedListIterator<DType>();
}
template<class DType>
void vtkLinkedListIterator<DType>::InitTraversal()
{
this->GoToFirstItem();
}
// Description:
// Retrieve the index of the element.
// This method returns VTK_OK if key was retrieved correctly.
template<class DType>
int vtkLinkedListIterator<DType>::GetKey(vtkIdType& key)
{
if ( !this->Pointer )
{
return VTK_ERROR;
}
vtkLinkedListNode<DType> *curr;
int cc = 0;
vtkLinkedList<DType> *llist
= static_cast<vtkLinkedList<DType>*>(this->Container);
for ( curr = llist->Head; curr; curr = curr->Next )
{
if ( curr == this->Pointer )
{
key = cc;
return VTK_OK;
}
cc ++;
}
return VTK_ERROR;
}
// Description:
// Retrieve the data from the iterator.
// This method returns VTK_OK if key was retrieved correctly.
template<class DType>
int vtkLinkedListIterator<DType>::GetData(DType& data)
{
if ( !this->Pointer )
{
return VTK_ERROR;
}
data = this->Pointer->Data;
return VTK_OK;
}
template<class DType>
int vtkLinkedListIterator<DType>::IsDoneWithTraversal()
{
if ( !this->Pointer )
{
return 1;
}
return 0;
}
template<class DType>
void vtkLinkedListIterator<DType>::GoToNextItem()
{
if(this->IsDoneWithTraversal())
{
this->GoToFirstItem();
}
else
{
this->Pointer = this->Pointer->Next;
}
}
template<class DType>
void vtkLinkedListIterator<DType>::GoToPreviousItem()
{
if(this->IsDoneWithTraversal())
{
this->GoToLastItem();
return;
}
vtkLinkedList<DType> *llist
= static_cast<vtkLinkedList<DType>*>(this->Container);
// Fast exit if at beginning of the list
if ( this->Pointer == llist->Head )
{
this->Pointer = 0;
return;
}
// Traverse the list to find the previous node
vtkLinkedListNode<DType> *curr = 0;
for ( curr = llist->Head; curr ; curr = curr->Next )
{
if ( curr->Next == this->Pointer )
{
break;
}
}
this->Pointer = curr;
}
template<class DType>
void vtkLinkedListIterator<DType>::GoToFirstItem()
{
vtkLinkedList<DType> *llist
= static_cast<vtkLinkedList<DType>*>(this->Container);
this->Pointer = llist->Head;
}
template<class DType>
void vtkLinkedListIterator<DType>::GoToLastItem()
{
vtkLinkedList<DType> *llist
= static_cast<vtkLinkedList<DType>*>(this->Container);
this->Pointer = llist->Tail;
}
#if defined ( _MSC_VER )
template <class DType>
vtkLinkedListIterator<DType>::vtkLinkedListIterator(const vtkLinkedListIterator<DType>&){}
template <class DType>
void vtkLinkedListIterator<DType>::operator=(const vtkLinkedListIterator<DType>&){}
#endif
#endif
|
