1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2005 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
16 //This class is from CSDM for AMX Mod X
22 friend class iterator;
26 ListNode(const T & o) : obj(o) { };
33 ListNode *_Initialize()
35 ListNode *n = (ListNode *)malloc(sizeof(ListNode));
41 List() : m_Head(_Initialize()), m_Size(0)
44 List(const List &src) : m_Head(_Initialize()), m_Size(0)
47 for (iter=src.begin(); iter!=src.end(); iter++)
59 void push_back(const T &obj)
61 ListNode *node = new ListNode(obj);
65 //link in the node as the first item
71 node->prev = m_Head->prev;
73 m_Head->prev->next = node;
84 ListNode *node = m_Head->next;
88 while (node && node != m_Head)
98 return (m_Head->next == NULL);
102 return m_Head->prev->obj;
116 iterator(const List &src)
120 iterator(ListNode *n) : m_This(n)
123 iterator(const iterator &where)
125 m_This = where.m_This;
127 iterator & operator--()
130 m_This = m_This->prev;
134 iterator & operator++()
137 m_This = m_This->next;
141 iterator operator++(int)
145 m_This = m_This->next;
148 T & operator * () const
156 T * operator -> () const
158 return &(m_This->obj);
160 bool operator != (iterator &where)
162 return (m_This != where.m_This);
164 bool operator ==(iterator &where)
166 return (m_This == where.m_This);
168 bool operator ==(const iterator &where) const
170 return (m_This == where.m_This);
176 iterator begin() const
179 return iterator(m_Head->next);
181 return iterator(m_Head);
185 return iterator(m_Head);
187 iterator erase(iterator &where)
189 ListNode *pNode = where.m_This;
190 iterator iter(where);
193 //If we are both the head and tail...
194 if (m_Head->next == pNode && m_Head->prev == pNode)
198 } else if (m_Head->next == pNode) {
199 //we are only the first
200 pNode->next->prev = m_Head;
201 m_Head->next = pNode->next;
202 } else if (m_Head->prev == pNode) {
204 pNode->prev->next = m_Head;
205 m_Head->prev = pNode->prev;
208 pNode->prev->next = pNode->next;
209 pNode->next->prev = pNode->prev;
218 void remove(const T & obj)
221 for (b=begin(); b!=end(); b++)
230 template <typename U>
231 iterator find(const U & equ)
234 for (iter=begin(); iter!=end(); iter++)
236 if ( (*iter) == equ )
241 List & operator =(List &src)
244 for (iter=src.begin(); iter!=src.end(); iter++)
245 push_back( (*iter) );
251 #endif //_INCLUDE_CSDM_LIST_H