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;
140 iterator operator++(int)
144 m_This = m_This->next;
147 T & operator * () const
155 T * operator -> () const
157 return &(m_This->obj);
159 bool operator != (iterator &where)
161 return (m_This != where.m_This);
163 bool operator ==(iterator &where)
165 return (m_This == where.m_This);
171 iterator begin() const
174 return iterator(m_Head->next);
176 return iterator(m_Head);
180 return iterator(m_Head);
182 iterator erase(iterator &where)
184 ListNode *pNode = where.m_This;
185 iterator iter(where);
188 //If we are both the head and tail...
189 if (m_Head->next == pNode && m_Head->prev == pNode)
193 } else if (m_Head->next == pNode) {
194 //we are only the first
195 pNode->next->prev = m_Head;
196 m_Head->next = pNode->next;
197 } else if (m_Head->prev == pNode) {
199 pNode->prev->next = m_Head;
200 m_Head->prev = pNode->prev;
203 pNode->prev->next = pNode->next;
204 pNode->next->prev = pNode->prev;
213 void remove(const T & obj)
216 for (b=begin(); b!=end(); b++)
225 template <typename U>
226 iterator find(const U & equ)
229 for (iter=begin(); iter!=end(); iter++)
231 if ( (*iter) == equ )
236 List & operator =(List &src)
239 for (iter=src.begin(); iter!=src.end(); iter++)
240 push_back( (*iter) );
246 #endif //_INCLUDE_CSDM_LIST_H