| author | David Anderson <dvander@alliedmods.net> |
| Tue Sep 13 20:21:58 2005 +0000 (2005-09-13) | |
| changeset 107 | 1d6e7e0bdcd9 |
| parent 101 | 7d93aa4d2bf3 |
| child 111 | aec58c99dafc |
| permissions | -rw-r--r-- |
| dvander@98 | 1 |
/* ======== SourceMM ======== |
| dvander@98 | 2 |
* Copyright (C) 2004-2005 Metamod:Source Development Team |
| dvander@98 | 3 |
* No warranties of any kind |
| dvander@98 | 4 |
* |
| dvander@98 | 5 |
* License: zlib/libpng |
| dvander@98 | 6 |
* |
| dvander@98 | 7 |
* Author(s): David "BAILOPAN" Anderson |
| dvander@98 | 8 |
* ============================ |
| dvander@98 | 9 |
*/ |
| dvander@98 | 10 |
|
| dvander@98 | 11 |
#ifndef _INCLUDE_SMM_LIST_H |
| dvander@98 | 12 |
#define _INCLUDE_SMM_LIST_H |
| dvander@98 | 13 |
|
| dvander@107 | 14 |
#include <malloc.h> |
| dvander@107 | 15 |
|
| dvander@98 | 16 |
namespace SourceHook |
| dvander@98 | 17 |
{ |
| dvander@99 | 18 |
//This class is from CSDM for AMX Mod X |
| dvander@98 | 19 |
template <class T> |
| dvander@98 | 20 |
class List |
| dvander@98 | 21 |
{ |
| dvander@98 | 22 |
public: |
| dvander@98 | 23 |
class iterator; |
| dvander@98 | 24 |
friend class iterator; |
| dvander@98 | 25 |
class ListNode |
| dvander@98 | 26 |
{ |
| dvander@98 | 27 |
public: |
| dvander@98 | 28 |
ListNode(const T & o) : obj(o) { }; |
| dvander@98 | 29 |
ListNode() { }; |
| dvander@98 | 30 |
T obj; |
| dvander@98 | 31 |
ListNode *next; |
| dvander@98 | 32 |
ListNode *prev; |
| dvander@98 | 33 |
}; |
| dvander@98 | 34 |
private: |
| dvander@98 | 35 |
ListNode *_Initialize() |
| dvander@98 | 36 |
{ |
| dvander@98 | 37 |
ListNode *n = (ListNode *)malloc(sizeof(ListNode)); |
| dvander@98 | 38 |
n->next = NULL; |
| dvander@98 | 39 |
n->prev = NULL; |
| dvander@98 | 40 |
return n; |
| dvander@98 | 41 |
} |
| dvander@98 | 42 |
public: |
| dvander@98 | 43 |
List() : m_Head(_Initialize()), m_Size(0) |
| dvander@98 | 44 |
{ |
| dvander@98 | 45 |
} |
| dvander@98 | 46 |
List(const List &src) : m_Head(_Initialize()), m_Size(0) |
| dvander@98 | 47 |
{ |
| dvander@98 | 48 |
iterator iter; |
| dvander@98 | 49 |
for (iter=src.begin(); iter!=src.end(); iter++) |
| dvander@98 | 50 |
push_back( (*iter) ); |
| dvander@98 | 51 |
} |
| dvander@98 | 52 |
~List() |
| dvander@98 | 53 |
{ |
| dvander@98 | 54 |
clear(); |
| dvander@98 | 55 |
if (m_Head) |
| dvander@98 | 56 |
{ |
| dvander@98 | 57 |
free(m_Head); |
| dvander@98 | 58 |
m_Head = NULL; |
| dvander@98 | 59 |
} |
| dvander@98 | 60 |
} |
| dvander@98 | 61 |
void push_back(const T &obj) |
| dvander@98 | 62 |
{ |
| dvander@98 | 63 |
ListNode *node = new ListNode(obj); |
| dvander@98 | 64 |
|
| dvander@98 | 65 |
if (!m_Head->prev) |
| dvander@98 | 66 |
{ |
| dvander@98 | 67 |
//link in the node as the first item |
| dvander@98 | 68 |
node->next = m_Head; |
| dvander@98 | 69 |
node->prev = m_Head; |
| dvander@98 | 70 |
m_Head->prev = node; |
| dvander@98 | 71 |
m_Head->next = node; |
| dvander@98 | 72 |
} else { |
| dvander@98 | 73 |
node->prev = m_Head->prev; |
| dvander@98 | 74 |
node->next = m_Head; |
| dvander@98 | 75 |
m_Head->prev->next = node; |
| dvander@98 | 76 |
m_Head->prev = node; |
| dvander@98 | 77 |
} |
| dvander@98 | 78 |
m_Size++; |
| dvander@98 | 79 |
} |
| dvander@98 | 80 |
size_t size() |
| dvander@98 | 81 |
{ |
| dvander@98 | 82 |
return m_Size; |
| dvander@98 | 83 |
} |
| dvander@98 | 84 |
void clear() |
| dvander@98 | 85 |
{ |
| dvander@98 | 86 |
ListNode *node = m_Head->next; |
| dvander@98 | 87 |
ListNode *temp; |
| dvander@98 | 88 |
m_Head->next = NULL; |
| dvander@98 | 89 |
m_Head->prev = NULL; |
| dvander@98 | 90 |
while (node && node != m_Head) |
| dvander@98 | 91 |
{ |
| dvander@98 | 92 |
temp = node->next; |
| dvander@98 | 93 |
delete node; |
| dvander@98 | 94 |
node = temp; |
| dvander@98 | 95 |
} |
| dvander@98 | 96 |
m_Size = 0; |
| dvander@98 | 97 |
} |
| dvander@98 | 98 |
bool empty() |
| dvander@98 | 99 |
{ |
| dvander@98 | 100 |
return (m_Head->next == NULL); |
| dvander@98 | 101 |
} |
| dvander@98 | 102 |
T & back() |
| dvander@98 | 103 |
{ |
| dvander@98 | 104 |
return m_Head->prev->obj; |
| dvander@98 | 105 |
} |
| dvander@98 | 106 |
private: |
| dvander@98 | 107 |
ListNode *m_Head; |
| dvander@98 | 108 |
size_t m_Size; |
| dvander@98 | 109 |
public: |
| dvander@98 | 110 |
class iterator |
| dvander@98 | 111 |
{ |
| dvander@98 | 112 |
friend class List; |
| dvander@98 | 113 |
public: |
| dvander@98 | 114 |
iterator() |
| dvander@98 | 115 |
{ |
| dvander@98 | 116 |
m_This = NULL; |
| dvander@98 | 117 |
} |
| dvander@98 | 118 |
iterator(const List &src) |
| dvander@98 | 119 |
{ |
| dvander@98 | 120 |
m_This = src.m_Head; |
| dvander@98 | 121 |
} |
| dvander@98 | 122 |
iterator(ListNode *n) : m_This(n) |
| dvander@98 | 123 |
{ |
| dvander@98 | 124 |
} |
| dvander@98 | 125 |
iterator(const iterator &where) |
| dvander@98 | 126 |
{ |
| dvander@98 | 127 |
m_This = where.m_This; |
| dvander@98 | 128 |
} |
| dvander@98 | 129 |
iterator & operator--() |
| dvander@98 | 130 |
{ |
| dvander@98 | 131 |
if (m_This) |
| dvander@98 | 132 |
m_This = m_This->prev; |
| dvander@98 | 133 |
return *this; |
| dvander@98 | 134 |
} |
| dvander@98 | 135 |
//pre increment |
| dvander@98 | 136 |
iterator & operator++() |
| dvander@98 | 137 |
{ |
| dvander@98 | 138 |
if (m_This) |
| dvander@98 | 139 |
m_This = m_This->next; |
| dvander@98 | 140 |
return *this; |
| dvander@98 | 141 |
} |
| dvander@101 | 142 |
//post increment |
| dvander@98 | 143 |
iterator operator++(int) |
| dvander@98 | 144 |
{ |
| dvander@98 | 145 |
iterator old(*this); |
| dvander@98 | 146 |
if (m_This) |
| dvander@98 | 147 |
m_This = m_This->next; |
| dvander@98 | 148 |
return old; |
| dvander@98 | 149 |
} |
| dvander@98 | 150 |
T & operator * () const |
| dvander@98 | 151 |
{ |
| dvander@98 | 152 |
return m_This->obj; |
| dvander@98 | 153 |
} |
| dvander@98 | 154 |
T & operator * () |
| dvander@98 | 155 |
{ |
| dvander@98 | 156 |
return m_This->obj; |
| dvander@98 | 157 |
} |
| dvander@98 | 158 |
T * operator -> () const |
| dvander@98 | 159 |
{ |
| dvander@98 | 160 |
return &(m_This->obj); |
| dvander@98 | 161 |
} |
| dvander@107 | 162 |
bool operator != (const iterator &where) const |
| dvander@98 | 163 |
{ |
| dvander@98 | 164 |
return (m_This != where.m_This); |
| dvander@98 | 165 |
} |
| dvander@101 | 166 |
bool operator ==(const iterator &where) const |
| dvander@101 | 167 |
{ |
| dvander@101 | 168 |
return (m_This == where.m_This); |
| dvander@101 | 169 |
} |
| dvander@98 | 170 |
private: |
| dvander@98 | 171 |
ListNode *m_This; |
| dvander@98 | 172 |
}; |
| dvander@98 | 173 |
public: |
| dvander@98 | 174 |
iterator begin() const |
| dvander@98 | 175 |
{ |
| dvander@98 | 176 |
if (m_Size) |
| dvander@98 | 177 |
return iterator(m_Head->next); |
| dvander@98 | 178 |
else |
| dvander@98 | 179 |
return iterator(m_Head); |
| dvander@98 | 180 |
} |
| dvander@98 | 181 |
iterator end() const |
| dvander@98 | 182 |
{ |
| dvander@98 | 183 |
return iterator(m_Head); |
| dvander@98 | 184 |
} |
| dvander@98 | 185 |
iterator erase(iterator &where) |
| dvander@98 | 186 |
{ |
| dvander@98 | 187 |
ListNode *pNode = where.m_This; |
| dvander@98 | 188 |
iterator iter(where); |
| dvander@98 | 189 |
iter++; |
| dvander@98 | 190 |
|
| dvander@98 | 191 |
//If we are both the head and tail... |
| dvander@98 | 192 |
if (m_Head->next == pNode && m_Head->prev == pNode) |
| dvander@98 | 193 |
{ |
| dvander@98 | 194 |
m_Head->next = NULL; |
| dvander@98 | 195 |
m_Head->prev = NULL; |
| dvander@98 | 196 |
} else if (m_Head->next == pNode) { |
| dvander@98 | 197 |
//we are only the first |
| dvander@98 | 198 |
pNode->next->prev = m_Head; |
| dvander@98 | 199 |
m_Head->next = pNode->next; |
| dvander@98 | 200 |
} else if (m_Head->prev == pNode) { |
| dvander@98 | 201 |
//we are the tail |
| dvander@98 | 202 |
pNode->prev->next = m_Head; |
| dvander@98 | 203 |
m_Head->prev = pNode->prev; |
| dvander@98 | 204 |
} else { |
| dvander@98 | 205 |
//middle unlink |
| dvander@98 | 206 |
pNode->prev->next = pNode->next; |
| dvander@98 | 207 |
pNode->next->prev = pNode->prev; |
| dvander@98 | 208 |
} |
| dvander@98 | 209 |
|
| dvander@98 | 210 |
delete pNode; |
| dvander@98 | 211 |
m_Size--; |
| dvander@98 | 212 |
|
| dvander@98 | 213 |
return iter; |
| dvander@98 | 214 |
} |
| dvander@98 | 215 |
public: |
| dvander@98 | 216 |
void remove(const T & obj) |
| dvander@98 | 217 |
{ |
| dvander@98 | 218 |
iterator b; |
| dvander@98 | 219 |
for (b=begin(); b!=end(); b++) |
| dvander@98 | 220 |
{ |
| dvander@98 | 221 |
if ( (*b) == obj ) |
| dvander@98 | 222 |
{ |
| dvander@98 | 223 |
erase( b ); |
| dvander@98 | 224 |
break; |
| dvander@98 | 225 |
} |
| dvander@98 | 226 |
} |
| dvander@98 | 227 |
} |
| dvander@98 | 228 |
template <typename U> |
| dvander@98 | 229 |
iterator find(const U & equ) |
| dvander@98 | 230 |
{ |
| dvander@98 | 231 |
iterator iter; |
| dvander@98 | 232 |
for (iter=begin(); iter!=end(); iter++) |
| dvander@98 | 233 |
{ |
| dvander@98 | 234 |
if ( (*iter) == equ ) |
| dvander@98 | 235 |
return iter; |
| dvander@98 | 236 |
} |
| dvander@98 | 237 |
return end(); |
| dvander@98 | 238 |
} |
| dvander@98 | 239 |
List & operator =(List &src) |
| dvander@98 | 240 |
{ |
| dvander@98 | 241 |
iterator iter; |
| dvander@98 | 242 |
for (iter=src.begin(); iter!=src.end(); iter++) |
| dvander@98 | 243 |
push_back( (*iter) ); |
| dvander@98 | 244 |
return *this; |
| dvander@98 | 245 |
} |
| dvander@98 | 246 |
}; |
| dvander@98 | 247 |
}; //NAMESPACE |
| dvander@98 | 248 |
|
| dvander@98 | 249 |
#endif //_INCLUDE_CSDM_LIST_H |