correct version now... i guess i'm just tired :)
1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2007 Metamod:Source Development Team
3 * No warranties of any kind
7 * Author(s): David "BAILOPAN" Anderson
8 * ============================
11 #ifndef _INCLUDE_SMM_LIST_H
12 #define _INCLUDE_SMM_LIST_H
20 //This class is from CSDM for AMX Mod X
22 A circular, doubly-linked list with one sentinel node
26 m_Head->next = m_Head;
27 m_Head->prev = m_Head;
48 friend class iterator;
52 ListNode(const T & o) : obj(o) { };
59 // Initializes the sentinel node.
60 // BAIL used malloc instead of new in order to bypass the need for a constructor.
61 ListNode *_Initialize()
63 ListNode *n = (ListNode *)malloc(sizeof(ListNode));
69 List() : m_Head(_Initialize()), m_Size(0)
72 List(const List &src) : m_Head(_Initialize()), m_Size(0)
75 for (iter=src.begin(); iter!=src.end(); iter++)
82 // Don't forget to free the sentinel
89 void push_back(const T &obj)
91 ListNode *node = new ListNode(obj);
93 node->prev = m_Head->prev;
95 m_Head->prev->next = node;
101 void push_front(const T &obj)
103 insert(begin(), obj);
113 ListNode *node = m_Head->next;
115 m_Head->next = m_Head;
116 m_Head->prev = m_Head;
118 // Iterate through the nodes until we find g_Head (the sentinel) again
119 while (node != m_Head)
129 return (m_Size == 0);
133 return m_Head->next->obj;
137 return m_Head->prev->obj;
151 iterator(const List &src)
155 iterator(ListNode *n) : m_This(n)
158 iterator(const iterator &where)
160 m_This = where.m_This;
163 iterator & operator--()
166 m_This = m_This->prev;
170 iterator operator--(int)
174 m_This = m_This->prev;
179 iterator & operator++()
182 m_This = m_This->next;
186 iterator operator++(int)
190 m_This = m_This->next;
194 const T & operator * () const
205 return &(m_This->obj);
207 const T * operator -> () const
209 return &(m_This->obj);
212 bool operator != (const iterator &where) const
214 return (m_This != where.m_This);
216 bool operator ==(const iterator &where) const
218 return (m_This == where.m_This);
223 return m_This != NULL;
229 iterator begin() const
231 return iterator(m_Head->next);
235 return iterator(m_Head);
237 iterator erase(iterator &where)
239 ListNode *pNode = where.m_This;
240 iterator iter(where);
244 // Works for all cases: empty list, erasing first element, erasing tail, erasing in the middle...
245 pNode->prev->next = pNode->next;
246 pNode->next->prev = pNode->prev;
254 iterator insert(iterator where, const T &obj)
256 // Insert obj right before where
258 ListNode *node = new ListNode(obj);
259 ListNode *pWhereNode = where.m_This;
261 pWhereNode->prev->next = node;
262 node->prev = pWhereNode->prev;
263 pWhereNode->prev = node;
264 node->next = pWhereNode;
268 return iterator(node);
272 void remove(const T & obj)
275 for (b=begin(); b!=end(); b++)
284 template <typename U>
285 iterator find(const U & equ) const
288 for (iter=begin(); iter!=end(); iter++)
290 if ( (*iter) == equ )
295 List & operator =(const List &src)
299 for (iter=src.begin(); iter!=src.end(); iter++)
300 push_back( (*iter) );
306 #endif //_INCLUDE_CSDM_LIST_H