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
|
/*=========================================================================
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.
=========================================================================*/
// .NAME vtkLinkedList - a templated linked list
#ifndef __vtkLinkedList_h
#define __vtkLinkedList_h
#include "vtkAbstractList.h"
template <class DType> class vtkLinkedListNode;
template <class DType> class vtkLinkedListIterator;
template <class DType>
class vtkLinkedList : public vtkAbstractList<DType>
{
friend class vtkLinkedListIterator<DType>;
virtual const char* GetClassNameInternal() const { return "vtkLinkedList"; }
public:
typedef vtkAbstractList<DType> Superclass;
typedef vtkLinkedListIterator<DType> IteratorType;
static vtkLinkedList<DType> *New();
// Description:
// Return an iterator to the list. This iterator is allocated using
// New, so the developer is responsible for deleating it.
vtkLinkedListIterator<DType> *NewIterator();
// Description:
// Append an Item to the end of the linked list.
int AppendItem(DType a);
// Description:
// Insert an Item to the front of the linked list.
int PrependItem(DType a);
// Description:
// Insert an Item to the specific location in the linked list.
int InsertItem(vtkIdType loc, DType a);
// Description:
// Sets the Item at the specific location in the list to a new value.
// It also checks if the item can be set.
// It returns VTK_OK if successfull.
int SetItem(vtkIdType loc, DType a);
// Description:
// Sets the Item at the specific location in the list to a new value.
// This method does not perform any error checking.
void SetItemNoCheck(vtkIdType loc, DType a);
// Description:
// Remove an Item from the linked list
int RemoveItem(vtkIdType id);
// Description:
// Return an item that was previously added to this linked list.
int GetItem(vtkIdType id, DType& ret);
// Description:
// Find an item in the linked list. Return VTK_OK if it was found
// od VTK_ERROR if not found. The location of the item is returned in res.
int FindItem(DType a, vtkIdType &res);
// Description:
// Find an item in the linked list using a comparison routine.
// Return VTK_OK if it was found
// od VTK_ERROR if not found. The location of the item is returned in res.
int FindItem(DType a,
vtkAbstractListCompareFunction(DType, compare),
vtkIdType &res);
// Description:
// Return the number of items currently held in this container. This
// different from GetSize which is provided for some containers. GetSize
// will return how many items the container can currently hold.
vtkIdType GetNumberOfItems() const { return this->NumberOfItems; }
// Description:
// Returns the number of items the container can currently hold.
// Since capacity is arbitrary for the linked list, this will
// always return the current number of elements.
vtkIdType GetSize() const { return this->NumberOfItems; }
// Description:
// Removes all items from the container.
void RemoveAllItems();
// Description:
// Since linked list does not have the notion of capacity,
// this method always return VTK_ERROR.
int SetSize(vtkIdType ) { return VTK_ERROR; }
// Description:
// This method dumps debug of the linked list.
void DebugList();
protected:
vtkLinkedList() {
this->Head = 0; this->Tail = 0;
this->NumberOfItems = 0;
}
virtual ~vtkLinkedList();
// Description:
// Find a node with given index.
vtkLinkedListNode<DType>* FindNode(vtkIdType i);
vtkIdType NumberOfItems;
vtkLinkedListNode<DType> *Head;
vtkLinkedListNode<DType> *Tail;
private:
vtkLinkedList(const vtkLinkedList<DType>&); // Not implemented
void operator=(const vtkLinkedList<DType>&); // Not implemented
};
#ifdef VTK_NO_EXPLICIT_TEMPLATE_INSTANTIATION
#include "vtkLinkedList.txx"
#endif
#endif
|
