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
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
|
/* xblnklstord.h
XBase64 Software Library
Copyright (c) 1997,2003,2014,2019,2022 Gary A Kunkel
The xb64 software library is covered under the terms of the GPL Version 3, 2007 license.
Email Contact:
XDB-devel@lists.sourceforge.net
XDB-users@lists.sourceforge.net
*/
// Ordered link list
#ifndef __XB_XBLNKLSTORD_H__
#define __XB_XBLNKLSTORD_H__
#ifdef XB_LINKLIST_SUPPORT
namespace xb{
template<class xbNodeType>
class XBDLLEXPORT xbLinkListOrd {
public:
xbLinkListOrd();
~xbLinkListOrd();
void Clear();
xbLinkListNode<xbNodeType> *GetHeadNode() const;
xbLinkListNode<xbNodeType> *GetEndNode() const;
xbLinkListNode<xbNodeType> *GetNodeForKey( const xbString &sKey ) const;
xbInt16 GetDataForKey ( const xbNodeType &ntKey, xbString &sData );
xbBool GetDupKeys ();
xbUInt32 GetNodeCnt () const;
xbUInt32 GetNodeCnt ( const xbString &sNodeKey ) const;
xbInt16 InsertKey ( const xbNodeType &ntKey );
xbInt16 InsertKey ( const xbNodeType &ntKey, const xbString &sData );
xbInt16 InsertKey ( const xbNodeType &ntKey, xbUInt32 ulData );
xbBool KeyExists ( const xbNodeType &ntKey ) const;
xbInt16 RemoveKey ( const xbNodeType &ntKey );
xbInt16 RemoveFromEnd ( xbNodeType &ntKey );
xbInt16 RemoveFromFront( xbNodeType &ntKey );
xbInt16 RemoveFromFront();
void SetDupKeys ( xbBool bAllowDupKeys );
xbInt16 UpdateForKey ( const xbNodeType &ntKey, const xbString &sData );
private:
xbUInt32 ulNodeCnt;
xbBool bAllowDupKeys;
xbLinkListNode<xbNodeType> *llStartPtr;
xbLinkListNode<xbNodeType> *llEndPtr;
};
template<class xbNodeType>
xbLinkListOrd<xbNodeType>::xbLinkListOrd(){
bAllowDupKeys = xbTrue; // default setting - allow duplicate keys
ulNodeCnt = 0;
llStartPtr = NULL;
llEndPtr = NULL;
}
template<class xbNodeType>
xbLinkListOrd<xbNodeType>::~xbLinkListOrd(){
Clear();
}
template<class xbNodeType>
void xbLinkListOrd<xbNodeType>::Clear(){
xbLinkListNode<xbNodeType> *cPtr = llStartPtr, *tPtr;
for( xbUInt32 i = 0; i < ulNodeCnt; i++ ){
tPtr = cPtr;
cPtr = cPtr->GetNextNode();
// next line might cause seg faults
// delete tPtr->GetData();
delete tPtr;
}
ulNodeCnt = 0;
llStartPtr = NULL;
llEndPtr = NULL;
}
template<class xbNodeType>
xbLinkListNode<xbNodeType> * xbLinkListOrd<xbNodeType>::GetHeadNode() const{
return llStartPtr;
}
template<class xbNodeType>
xbLinkListNode<xbNodeType> * xbLinkListOrd<xbNodeType>::GetEndNode() const{
return llEndPtr;
}
template<class xbNodeType>
xbUInt32 xbLinkListOrd<xbNodeType>::GetNodeCnt() const{
return ulNodeCnt;
}
template<class xbNodeType>
xbUInt32 xbLinkListOrd<xbNodeType>::GetNodeCnt( const xbString &sNodeKey ) const{
// won't work if nodekey is not a string
xbLinkListNode<xbNodeType> *currPtr = llStartPtr;
// skip to sNodeKey
while( currPtr && ( sNodeKey > currPtr->GetKey())) {
currPtr = currPtr->GetNextNode();
}
// count entries for sNodeKey
xbInt16 iKeyCnt = 0;
while( currPtr && ( sNodeKey == currPtr->GetKey())) {
iKeyCnt++;
currPtr = currPtr->GetNextNode();
}
return iKeyCnt;
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::InsertKey( const xbNodeType &ntKey ){
xbString s;
return InsertKey( ntKey, s );
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::InsertKey( const xbNodeType &ntKey, xbUInt32 ul ){
xbString s;
s.Sprintf( "%ld", ul );
return InsertKey( ntKey, s );
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::InsertKey( const xbNodeType &ntKey, const xbString &sData ){
xbLinkListNode<xbNodeType> *p = new xbLinkListNode<xbNodeType>( ntKey, sData );
if( p == 0 )
return XB_NO_MEMORY;
if( ulNodeCnt > 0 ){
xbLinkListNode<xbNodeType> *currPtr = llStartPtr;
xbLinkListNode<xbNodeType> *prevPtr = NULL;
// find location in the chain
while( currPtr && ntKey > currPtr->GetKey() ){
prevPtr = currPtr;
currPtr = currPtr->GetNextNode();
}
if( currPtr && ntKey == currPtr->GetKey() && bAllowDupKeys == 0 ){
delete p;
return XB_KEY_NOT_UNIQUE;
}
if( currPtr == NULL ){
// std::cout << "at the end of the chain\n";
llEndPtr = p;
prevPtr->SetNextNode( p );
p->SetPrevNode( prevPtr );
} else if( currPtr->GetPrevNode() == NULL ){
// std::cout << "at the beginning of the chain\n";
p->SetNextNode( llStartPtr );
llStartPtr->SetPrevNode( p );
llStartPtr = p;
} else {
// std::cout << "in the middle of the chain\n";
p->SetNextNode( currPtr );
p->SetPrevNode( currPtr->GetPrevNode());
currPtr->SetPrevNode( p );
prevPtr->SetNextNode( p );
}
} else {
// std::cout << "first addition to the chain\n";
llStartPtr = p;
llEndPtr = p;
}
ulNodeCnt++;
return XB_NO_ERROR;
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::RemoveKey( const xbNodeType &ntKey ){
// Remove the first instance of ntKey from the node chain
xbLinkListNode<xbNodeType> *currPtr = llStartPtr;
xbLinkListNode<xbNodeType> *prevPtr = NULL;
while( currPtr && ntKey > currPtr->GetKey() ){
prevPtr = currPtr;
currPtr = currPtr->GetNextNode();
}
if( currPtr && ntKey == currPtr->GetKey()){
// ntKey = currPtr->GetKey();
if( prevPtr == NULL ){ // this is the first node
llStartPtr = currPtr->GetNextNode();
// next line fails
if( llStartPtr ){
llStartPtr->SetPrevNode( NULL );
}
delete currPtr;
ulNodeCnt--;
return XB_NO_ERROR;
} else if( currPtr->GetNextNode() == NULL ){ // this is the last node
llEndPtr = prevPtr;
prevPtr->SetNextNode( NULL );
delete currPtr;
ulNodeCnt--;
return XB_NO_ERROR;
} else {
prevPtr->SetNextNode( currPtr->GetNextNode());
currPtr->GetNextNode()->SetPrevNode( prevPtr );
delete currPtr;
ulNodeCnt--;
return XB_NO_ERROR;
}
} else {
return XB_NOT_FOUND;
}
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::RemoveFromFront( xbNodeType &ntKey ){
if( ulNodeCnt <= 0 )
return XB_INVALID_NODELINK;
xbLinkListNode<xbNodeType> *p = llStartPtr;
llStartPtr = p->GetNextNode();
if( llStartPtr )
llStartPtr->SetPrevNode( NULL );
ntKey = p->GetKey();
delete p;
ulNodeCnt--;
return XB_NO_ERROR;
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::RemoveFromFront(){
if( ulNodeCnt <= 0 )
return XB_INVALID_NODELINK;
xbLinkListNode<xbNodeType> *p = llStartPtr;
llStartPtr = p->GetNextNode();
if( llStartPtr )
llStartPtr->SetPrevNode( NULL );
if( p->GetKey())
delete p->GetKey();
delete p;
ulNodeCnt--;
return XB_NO_ERROR;
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::RemoveFromEnd( xbNodeType &ntKey ){
if( ulNodeCnt <= 0 )
return XB_INVALID_NODELINK;
xbLinkListNode<xbNodeType> *p = llEndPtr;
llEndPtr = p->GetPrevNode();
llEndPtr->SetNextNode( NULL );
ntKey = p->GetKey();
delete p;
ulNodeCnt--;
return XB_NO_ERROR;
}
template<class xbNodeType>
xbBool xbLinkListOrd<xbNodeType>::GetDupKeys(){
return bAllowDupKeys;
}
template<class xbNodeType>
void xbLinkListOrd<xbNodeType>::SetDupKeys( xbBool bAllowDupKeys ){
this->bAllowDupKeys = bAllowDupKeys;
}
template<class xbNodeType>
xbBool xbLinkListOrd<xbNodeType>::KeyExists( const xbNodeType &ntKey ) const {
xbLinkListNode<xbNodeType> *currPtr = llStartPtr;
while( currPtr && ntKey > currPtr->GetKey() ){
currPtr = currPtr->GetNextNode();
}
if( currPtr && ntKey == currPtr->GetKey()){
return xbTrue;
} else {
return xbFalse;
}
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::GetDataForKey( const xbNodeType &ntKey, xbString &sData ){
xbLinkListNode<xbNodeType> *currPtr = llStartPtr;
while( currPtr && ntKey > currPtr->GetKey() ){
currPtr = currPtr->GetNextNode();
}
if( currPtr && ntKey == currPtr->GetKey()){
sData = currPtr->GetData();
return XB_NO_ERROR;
} else {
return XB_NOT_FOUND;
}
}
template<class xbNodeType>
xbInt16 xbLinkListOrd<xbNodeType>::UpdateForKey( const xbNodeType &ntKey, const xbString &sData ){
if( ulNodeCnt == 0 )
return InsertKey( ntKey, sData );
xbLinkListNode<xbNodeType> * currPtr = llStartPtr;
xbLinkListNode<xbNodeType> * prevPtr = NULL;
while( currPtr && ntKey > currPtr->GetKey() ) {
prevPtr = currPtr;
currPtr = currPtr->GetNextNode();
}
if( currPtr && ntKey == currPtr->GetKey() ) {
xbLinkListNode<xbNodeType> *p = new xbLinkListNode<xbNodeType>( ntKey, sData );
if( prevPtr )
prevPtr->SetNextNode( p );
else
llStartPtr = p;
p->SetNextNode( currPtr->GetNextNode() );
p->SetPrevNode( currPtr->GetPrevNode() );
delete currPtr;
return XB_NO_ERROR;
}
return InsertKey( ntKey, sData );
// return 0;
}
} // namespace
#endif // XB_LINKLIST_SUPPORT
#endif // XB_XBLNKLSTORD_H__
|
