1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/sourcehook/sh_list.h Fri Aug 12 17:44:53 2005 +0000
1.3 @@ -0,0 +1,247 @@
1.4 +/* ======== SourceMM ========
1.5 +* Copyright (C) 2004-2005 Metamod:Source Development Team
1.6 +* No warranties of any kind
1.7 +*
1.8 +* License: zlib/libpng
1.9 +*
1.10 +* Author(s): David "BAILOPAN" Anderson
1.11 +* ============================
1.12 +*/
1.13 +
1.14 +#ifndef _INCLUDE_SMM_LIST_H
1.15 +#define _INCLUDE_SMM_LIST_H
1.16 +
1.17 +namespace SourceHook
1.18 +{
1.19 +//This class is from CSDM_amxx by BAILOPAN
1.20 +//
1.21 +template <class T>
1.22 +class List
1.23 +{
1.24 +public:
1.25 + class iterator;
1.26 + friend class iterator;
1.27 + class ListNode
1.28 + {
1.29 + public:
1.30 + ListNode(const T & o) : obj(o) { };
1.31 + ListNode() { };
1.32 + T obj;
1.33 + ListNode *next;
1.34 + ListNode *prev;
1.35 + };
1.36 +private:
1.37 + ListNode *_Initialize()
1.38 + {
1.39 + ListNode *n = (ListNode *)malloc(sizeof(ListNode));
1.40 + n->next = NULL;
1.41 + n->prev = NULL;
1.42 + return n;
1.43 + }
1.44 +public:
1.45 + List() : m_Head(_Initialize()), m_Size(0)
1.46 + {
1.47 + }
1.48 + List(const List &src) : m_Head(_Initialize()), m_Size(0)
1.49 + {
1.50 + iterator iter;
1.51 + for (iter=src.begin(); iter!=src.end(); iter++)
1.52 + push_back( (*iter) );
1.53 + }
1.54 + ~List()
1.55 + {
1.56 + clear();
1.57 + if (m_Head)
1.58 + {
1.59 + free(m_Head);
1.60 + m_Head = NULL;
1.61 + }
1.62 + }
1.63 + void push_back(const T &obj)
1.64 + {
1.65 + ListNode *node = new ListNode(obj);
1.66 +
1.67 + if (!m_Head->prev)
1.68 + {
1.69 + //link in the node as the first item
1.70 + node->next = m_Head;
1.71 + node->prev = m_Head;
1.72 + m_Head->prev = node;
1.73 + m_Head->next = node;
1.74 + } else {
1.75 + node->prev = m_Head->prev;
1.76 + node->next = m_Head;
1.77 + m_Head->prev->next = node;
1.78 + m_Head->prev = node;
1.79 + }
1.80 + m_Size++;
1.81 + }
1.82 + size_t size()
1.83 + {
1.84 + return m_Size;
1.85 + }
1.86 + void clear()
1.87 + {
1.88 + ListNode *node = m_Head->next;
1.89 + ListNode *temp;
1.90 + m_Head->next = NULL;
1.91 + m_Head->prev = NULL;
1.92 + while (node && node != m_Head)
1.93 + {
1.94 + temp = node->next;
1.95 + delete node;
1.96 + node = temp;
1.97 + }
1.98 + m_Size = 0;
1.99 + }
1.100 + bool empty()
1.101 + {
1.102 + return (m_Head->next == NULL);
1.103 + }
1.104 + T & back()
1.105 + {
1.106 + return m_Head->prev->obj;
1.107 + }
1.108 +private:
1.109 + ListNode *m_Head;
1.110 + size_t m_Size;
1.111 +public:
1.112 + class iterator
1.113 + {
1.114 + friend class List;
1.115 + public:
1.116 + iterator()
1.117 + {
1.118 + m_This = NULL;
1.119 + }
1.120 + iterator(const List &src)
1.121 + {
1.122 + m_This = src.m_Head;
1.123 + }
1.124 + iterator(ListNode *n) : m_This(n)
1.125 + {
1.126 + }
1.127 + iterator(const iterator &where)
1.128 + {
1.129 + m_This = where.m_This;
1.130 + }
1.131 + iterator & operator--()
1.132 + {
1.133 + if (m_This)
1.134 + m_This = m_This->prev;
1.135 + return *this;
1.136 + }
1.137 + //pre increment
1.138 + iterator & operator++()
1.139 + {
1.140 + if (m_This)
1.141 + m_This = m_This->next;
1.142 + return *this;
1.143 + }
1.144 + iterator operator++(int)
1.145 + {
1.146 + iterator old(*this);
1.147 + if (m_This)
1.148 + m_This = m_This->next;
1.149 + return old;
1.150 + }
1.151 + T & operator * () const
1.152 + {
1.153 + return m_This->obj;
1.154 + }
1.155 + T & operator * ()
1.156 + {
1.157 + return m_This->obj;
1.158 + }
1.159 + T * operator -> () const
1.160 + {
1.161 + return &(m_This->obj);
1.162 + }
1.163 + bool operator != (iterator &where)
1.164 + {
1.165 + return (m_This != where.m_This);
1.166 + }
1.167 + bool operator ==(iterator &where)
1.168 + {
1.169 + return (m_This == where.m_This);
1.170 + }
1.171 + private:
1.172 + ListNode *m_This;
1.173 + };
1.174 +public:
1.175 + iterator begin() const
1.176 + {
1.177 + if (m_Size)
1.178 + return iterator(m_Head->next);
1.179 + else
1.180 + return iterator(m_Head);
1.181 + }
1.182 + iterator end() const
1.183 + {
1.184 + return iterator(m_Head);
1.185 + }
1.186 + iterator erase(iterator &where)
1.187 + {
1.188 + ListNode *pNode = where.m_This;
1.189 + iterator iter(where);
1.190 + iter++;
1.191 +
1.192 + //If we are both the head and tail...
1.193 + if (m_Head->next == pNode && m_Head->prev == pNode)
1.194 + {
1.195 + m_Head->next = NULL;
1.196 + m_Head->prev = NULL;
1.197 + } else if (m_Head->next == pNode) {
1.198 + //we are only the first
1.199 + pNode->next->prev = m_Head;
1.200 + m_Head->next = pNode->next;
1.201 + } else if (m_Head->prev == pNode) {
1.202 + //we are the tail
1.203 + pNode->prev->next = m_Head;
1.204 + m_Head->prev = pNode->prev;
1.205 + } else {
1.206 + //middle unlink
1.207 + pNode->prev->next = pNode->next;
1.208 + pNode->next->prev = pNode->prev;
1.209 + }
1.210 +
1.211 + delete pNode;
1.212 + m_Size--;
1.213 +
1.214 + return iter;
1.215 + }
1.216 +public:
1.217 + void remove(const T & obj)
1.218 + {
1.219 + iterator b;
1.220 + for (b=begin(); b!=end(); b++)
1.221 + {
1.222 + if ( (*b) == obj )
1.223 + {
1.224 + erase( b );
1.225 + break;
1.226 + }
1.227 + }
1.228 + }
1.229 + template <typename U>
1.230 + iterator find(const U & equ)
1.231 + {
1.232 + iterator iter;
1.233 + for (iter=begin(); iter!=end(); iter++)
1.234 + {
1.235 + if ( (*iter) == equ )
1.236 + return iter;
1.237 + }
1.238 + return end();
1.239 + }
1.240 + List & operator =(List &src)
1.241 + {
1.242 + iterator iter;
1.243 + for (iter=src.begin(); iter!=src.end(); iter++)
1.244 + push_back( (*iter) );
1.245 + return *this;
1.246 + }
1.247 +};
1.248 +}; //NAMESPACE
1.249 +
1.250 +#endif //_INCLUDE_CSDM_LIST_H