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
|
//+---------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1992-2001.
//
// File: LIST . H
//
// Contents:
//
// Notes: List manipulation functions.
//
//----------------------------------------------------------------------------
#ifndef LIST_H_INCLUDED
#define LIST_H_INCLUDED
#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
template<class X, class Y> class List {
struct Node {
X item;
Y key;
Node *next;
};
Node *m_head;
DWORD m_dwNodeCount;
public:
List ();
virtual ~List();
HRESULT Insert (X item,
Y key);
HRESULT Remove (X *item);
HRESULT RemoveThis (X item);
HRESULT RemoveByKey (Y key,
X *item);
VOID RemoveAll(VOID);
HRESULT Find (DWORD dwIndex,
X *item);
HRESULT FindByKey (Y key,
X *item);
DWORD ListCount (VOID);
};
template<class X, class Y> List<X, Y>::List ()
{
m_head = NULL;
m_dwNodeCount = 0;
}
template<class X, class Y> List<X, Y>::~List ()
{
RemoveAll();
}
template<class X, class Y> HRESULT List<X, Y>::Insert (X item,
Y key)
{
Node *pNewNode;
pNewNode = new Node;
if ( pNewNode ) {
pNewNode->item = item;
pNewNode->key = key;
pNewNode->next = NULL;
if ( m_dwNodeCount ) {
pNewNode->next = m_head;
}
m_head = pNewNode;
m_dwNodeCount++;
}
return ( pNewNode ) ? S_OK : HRESULT_FROM_WIN32(ERROR_NOT_ENOUGH_MEMORY);
}
template<class X, class Y> HRESULT List<X, Y>::Remove (X *item)
{
Node *temp;
if ( m_dwNodeCount == 0 ) {
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
*item = m_head->item;
temp = m_head;
m_head = m_head->next;
delete temp;
m_dwNodeCount--;
return S_OK;
}
template<class X, class Y> HRESULT List<X, Y>::RemoveThis (X item)
{
Node *temp;
Node *nodeToFind;
if ( m_dwNodeCount == 0 ) {
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
if ( m_head->item == item ) {
nodeToFind = m_head;
m_head = m_head->next;
}
else {
for (temp = m_head; temp->next && (temp->next->item != item); ) {
temp = temp->next;
}
if ( temp->next ) {
nodeToFind = temp->next;
temp->next = temp->next->next;
}
else
nodeToFind = NULL;
}
if ( nodeToFind ) {
delete nodeToFind;
m_dwNodeCount--;
return S_OK;
}
else
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
template<class X, class Y> HRESULT List<X, Y>::RemoveByKey (Y key,
X *item)
{
Node *temp;
Node *nodeToFind;
if ( m_dwNodeCount == 0 ) {
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
if ( m_head->key == key ) {
nodeToFind = m_head;
m_head = m_head->next;
}
else {
for (temp = m_head; temp->next && (temp->next->key != key); ) {
temp = temp->next;
}
if ( temp->next ) {
nodeToFind = temp->next;
temp->next = temp->next->next;
}
else
nodeToFind = NULL;
}
if ( nodeToFind ) {
*item = nodeToFind->item;
delete nodeToFind;
m_dwNodeCount--;
return S_OK;
}
else
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
template<class X, class Y> VOID List<X, Y>::RemoveAll (VOID)
{
Node *temp;
for (; m_dwNodeCount; --m_dwNodeCount) {
temp = m_head;
m_head = m_head->next;
delete temp;
}
return;
}
template<class X, class Y> HRESULT List<X, Y>::Find (DWORD dwIndex,
X *item)
{
Node *temp;
DWORD i;
if ( (m_dwNodeCount == 0) || (dwIndex > m_dwNodeCount) ) {
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
for (i=0, temp = m_head; i < dwIndex; ++i) {
temp = temp->next;
}
*item = temp->item;
return S_OK;
}
template<class X, class Y> HRESULT List<X, Y>::FindByKey (Y key,
X *item)
{
Node *temp;
for (temp = m_head; temp && (temp->key != key); )
temp = temp->next;
if ( temp ) {
*item = temp->item;
return S_OK;
}
else {
return HRESULT_FROM_WIN32(ERROR_NOT_FOUND);
}
}
template<class X, class Y> DWORD List<X, Y>::ListCount (VOID)
{
return m_dwNodeCount;
}
#endif
|
