blob: 691ec9e126258829993359fd2b01abbd2804de62 (
plain)
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
|
/**
* $Id$
*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
*/
#ifndef __SG_QLIST
#define __SG_QLIST
#include "SG_DList.h"
/**
* Double-Double circular linked list
* For storing an object is two lists simultaneously
*/
class SG_QList : public SG_DList
{
protected :
SG_QList* m_fqlink;
SG_QList* m_bqlink;
public:
template<typename T> class iterator
{
private:
SG_QList& m_head;
T* m_current;
public:
typedef iterator<T> _myT;
iterator(SG_QList& head, SG_QList* current=NULL) : m_head(head) { m_current = (T*)current; }
~iterator() {}
void begin()
{
m_current = (T*)m_head.QPeek();
}
void back()
{
m_current = (T*)m_head.QBack();
}
bool end()
{
return (m_current == (T*)m_head.Self());
}
bool add_back(T* item)
{
return m_current->QAddBack(item);
}
T* operator*()
{
return m_current;
}
_myT& operator++()
{
m_current = (T*)m_current->QPeek();
return *this;
}
_myT& operator--()
{
// no check on NULL! make sure you don't try to increment beyond end
m_current = (T*)m_current->QBack();
return *this;
}
};
SG_QList() : SG_DList()
{
m_fqlink = m_bqlink = this;
}
SG_QList(const SG_QList& other) : SG_DList()
{
m_fqlink = m_bqlink = this;
}
virtual ~SG_QList()
{
QDelink();
}
inline bool QEmpty() // Check for empty queue
{
return ( m_fqlink == this );
}
bool QAddBack( SG_QList *item ) // Add to the back
{
if (!item->QEmpty())
return false;
item->m_bqlink = m_bqlink;
item->m_fqlink = this;
m_bqlink->m_fqlink = item;
m_bqlink = item;
return true;
}
bool QAddFront( SG_QList *item ) // Add to the back
{
if (!item->Empty())
return false;
item->m_fqlink = m_fqlink;
item->m_bqlink = this;
m_fqlink->m_bqlink = item;
m_fqlink = item;
return true;
}
SG_QList *QRemove() // Remove from the front
{
if (QEmpty())
{
return NULL;
}
SG_QList* item = m_fqlink;
m_fqlink = item->m_fqlink;
m_fqlink->m_bqlink = this;
item->m_fqlink = item->m_bqlink = item;
return item;
}
bool QDelink() // Remove from the middle
{
if (QEmpty())
return false;
m_bqlink->m_fqlink = m_fqlink;
m_fqlink->m_bqlink = m_bqlink;
m_fqlink = m_bqlink = this;
return true;
}
inline SG_QList *QPeek() // Look at front without removing
{
return m_fqlink;
}
inline SG_QList *QBack() // Look at front without removing
{
return m_bqlink;
}
#ifdef WITH_CXX_GUARDEDALLOC
public:
void *operator new(size_t num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_QList"); }
void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};
#endif //__SG_QLIST
|
