1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/core/sourcehook/sh_tinyhash.h Fri Nov 14 04:04:02 2008 -0600
1.3 @@ -0,0 +1,534 @@
1.4 +/* ======== SourceMM ========
1.5 +* Copyright (C) 2004-2008 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_SH_TINYHASH_H_
1.15 +#define _INCLUDE_SH_TINYHASH_H_
1.16 +
1.17 +#include "sh_list.h"
1.18 +
1.19 +#define _T_INIT_HASH_SIZE 32
1.20 +
1.21 +namespace SourceHook
1.22 +{
1.23 + template <class K>
1.24 + int HashFunction(const K & k);
1.25 +
1.26 + template <class U>
1.27 + int HashAlt(const U &u);
1.28 +
1.29 + template <class U, class K>
1.30 + int CompareAlt(const U &k1, const K &k2);
1.31 +
1.32 + template <class K>
1.33 + int Compare(const K & k1, const K & k2);
1.34 +
1.35 + /**
1.36 + * This is a tiny, growable hash class.
1.37 + * Meant for quick and dirty dictionaries only!
1.38 + */
1.39 + template <class K, class V>
1.40 + class THash
1.41 + {
1.42 + public:
1.43 + struct THashNode
1.44 + {
1.45 + THashNode(const K & k, const V & v) :
1.46 + key(k), val(v)
1.47 + {
1.48 + };
1.49 + THashNode & operator =(const THashNode &other)
1.50 + {
1.51 + key = other.key;
1.52 + val = other.val;
1.53 + }
1.54 + K key;
1.55 + V val;
1.56 + };
1.57 + typedef List<THashNode *> * NodePtr;
1.58 + public:
1.59 + class const_iterator;
1.60 + THash() : m_Buckets(NULL), m_numBuckets(0), m_percentUsed(0.0f)
1.61 + {
1.62 + _Refactor();
1.63 + }
1.64 + THash(const THash &other) : m_Buckets(new NodePtr[other.m_numBuckets]),
1.65 + m_numBuckets(other.m_numBuckets), m_percentUsed(other.m_percentUsed)
1.66 + {
1.67 + for (size_t i=0; i<m_numBuckets; i++)
1.68 + m_Buckets[i] = NULL;
1.69 + for (const_iterator iter = other.begin(); iter != other.end(); ++iter)
1.70 + _FindOrInsert(iter->key)->val = iter->val;
1.71 + }
1.72 + void operator=(const THash &other)
1.73 + {
1.74 + clear();
1.75 + for (const_iterator iter = other.begin(); iter != other.end(); ++iter)
1.76 + _FindOrInsert(iter->key)->val = iter->val;
1.77 + }
1.78 +
1.79 + ~THash()
1.80 + {
1.81 + _Clear();
1.82 + }
1.83 + void clear()
1.84 + {
1.85 + _Clear();
1.86 + _Refactor();
1.87 + }
1.88 + size_t GetBuckets()
1.89 + {
1.90 + return m_numBuckets;
1.91 + }
1.92 + float PercentUsed()
1.93 + {
1.94 + return m_percentUsed;
1.95 + }
1.96 + V & operator [](const K & key)
1.97 + {
1.98 + THashNode *pNode = _FindOrInsert(key);
1.99 + return pNode->val;
1.100 + }
1.101 + private:
1.102 + void _Clear()
1.103 + {
1.104 + typename List<THashNode *>::iterator iter, end;
1.105 + for (size_t i=0; i<m_numBuckets; i++)
1.106 + {
1.107 + if (m_Buckets[i])
1.108 + {
1.109 + end = m_Buckets[i]->end();
1.110 + iter = m_Buckets[i]->begin();
1.111 + while (iter != end)
1.112 + {
1.113 + delete (*iter);
1.114 + iter++;
1.115 + }
1.116 + delete m_Buckets[i];
1.117 + m_Buckets[i] = NULL;
1.118 + }
1.119 + }
1.120 + if (m_Buckets)
1.121 + delete [] m_Buckets;
1.122 + m_Buckets = NULL;
1.123 + m_numBuckets = 0;
1.124 + }
1.125 + public:
1.126 + template <typename U>
1.127 + V & AltFindOrInsert(const U & ukey)
1.128 + {
1.129 + size_t place = HashAlt(ukey) % m_numBuckets;
1.130 + THashNode *pNode = NULL;
1.131 + if (!m_Buckets[place])
1.132 + {
1.133 + m_Buckets[place] = new List<THashNode *>;
1.134 + pNode = new THashNode(ukey, V());
1.135 + m_Buckets[place]->push_back(pNode);
1.136 + m_percentUsed += (1.0f / (float)m_numBuckets);
1.137 + } else {
1.138 + typename List<THashNode *>::iterator iter;
1.139 + for (iter=m_Buckets[place]->begin(); iter!=m_Buckets[place]->end(); iter++)
1.140 + {
1.141 + if (CompareAlt(ukey, (*iter)->key) == 0)
1.142 + {
1.143 + return (*iter)->val;
1.144 + }
1.145 + }
1.146 + //node does not exist
1.147 + pNode = new THashNode(ukey, V());
1.148 + m_Buckets[place]->push_back(pNode);
1.149 + }
1.150 + if (PercentUsed() > 0.75f)
1.151 + {
1.152 + _Refactor();
1.153 + }
1.154 + return pNode->val;
1.155 + }
1.156 + private:
1.157 + THashNode *_FindOrInsert(const K & key)
1.158 + {
1.159 + size_t place = HashFunction(key) % m_numBuckets;
1.160 + THashNode *pNode = NULL;
1.161 + if (!m_Buckets[place])
1.162 + {
1.163 + m_Buckets[place] = new List<THashNode *>;
1.164 + pNode = new THashNode(key, V());
1.165 + m_Buckets[place]->push_back(pNode);
1.166 + m_percentUsed += (1.0f / (float)m_numBuckets);
1.167 + } else {
1.168 + typename List<THashNode *>::iterator iter;
1.169 + for (iter=m_Buckets[place]->begin(); iter!=m_Buckets[place]->end(); iter++)
1.170 + {
1.171 + if (Compare((*iter)->key, key) == 0)
1.172 + return (*iter);
1.173 + }
1.174 + //node does not exist
1.175 + pNode = new THashNode(key, V());
1.176 + m_Buckets[place]->push_back(pNode);
1.177 + }
1.178 + if (PercentUsed() > 0.75f)
1.179 + {
1.180 + _Refactor();
1.181 + }
1.182 + return pNode;
1.183 + }
1.184 + void _Refactor()
1.185 + {
1.186 + m_percentUsed = 0.0f;
1.187 + if (!m_numBuckets)
1.188 + {
1.189 + m_numBuckets = _T_INIT_HASH_SIZE;
1.190 + m_Buckets = new NodePtr[m_numBuckets];
1.191 + for (size_t i=0; i<m_numBuckets; i++)
1.192 + m_Buckets[i] = NULL;
1.193 + } else {
1.194 + size_t oldSize = m_numBuckets;
1.195 + m_numBuckets *= 2;
1.196 + typename List<THashNode *>::iterator iter;
1.197 + size_t place;
1.198 + THashNode *pHashNode;
1.199 + NodePtr *temp = new NodePtr[m_numBuckets];
1.200 + for (size_t i=0; i<m_numBuckets; i++)
1.201 + temp[i] = NULL;
1.202 + //look in old hash table
1.203 + for (size_t i=0; i<oldSize; i++)
1.204 + {
1.205 + //does a bucket have anything?
1.206 + if (m_Buckets[i])
1.207 + {
1.208 + //go through the list of items
1.209 + for (iter = m_Buckets[i]->begin(); iter != m_Buckets[i]->end(); iter++)
1.210 + {
1.211 + pHashNode = (*iter);
1.212 + //rehash it with the new bucket filter
1.213 + place = HashFunction(pHashNode->key) % m_numBuckets;
1.214 + //add it to the new hash table
1.215 + if (!temp[place])
1.216 + {
1.217 + temp[place] = new List<THashNode *>;
1.218 + m_percentUsed += (1.0f / (float)m_numBuckets);
1.219 + }
1.220 + temp[place]->push_back(pHashNode);
1.221 + }
1.222 + //delete that bucket!
1.223 + delete m_Buckets[i];
1.224 + m_Buckets[i] = NULL;
1.225 + }
1.226 + }
1.227 + //reassign bucket table
1.228 + delete [] m_Buckets;
1.229 + m_Buckets = temp;
1.230 + }
1.231 + }
1.232 + public:
1.233 + class iterator
1.234 + {
1.235 + friend class THash;
1.236 + public:
1.237 + iterator() : curbucket(-1), hash(NULL), end(true)
1.238 + {
1.239 + };
1.240 + iterator(THash *h) : curbucket(-1), hash(h), end(false)
1.241 + {
1.242 + if (!h->m_Buckets)
1.243 + end = true;
1.244 + else
1.245 + _Inc();
1.246 + };
1.247 + //pre increment
1.248 + iterator & operator++()
1.249 + {
1.250 + _Inc();
1.251 + return *this;
1.252 + }
1.253 + //post increment
1.254 + iterator operator++(int)
1.255 + {
1.256 + iterator old(*this);
1.257 + _Inc();
1.258 + return old;
1.259 + }
1.260 + const THashNode & operator * () const
1.261 + {
1.262 + return *(*iter);
1.263 + }
1.264 + THashNode & operator * ()
1.265 + {
1.266 + return *(*iter);
1.267 + }
1.268 + const THashNode * operator ->() const
1.269 + {
1.270 + return (*iter);
1.271 + }
1.272 + THashNode * operator ->()
1.273 + {
1.274 + return (*iter);
1.275 + }
1.276 + bool operator ==(const iterator &where) const
1.277 + {
1.278 + if (where.hash == this->hash
1.279 + && where.end == this->end
1.280 + &&
1.281 + (this->end ||
1.282 + ((where.curbucket == this->curbucket)
1.283 + && (where.iter == iter))
1.284 + ))
1.285 + return true;
1.286 + return false;
1.287 + }
1.288 + bool operator !=(const iterator &where) const
1.289 + {
1.290 + return !( (*this) == where );
1.291 + }
1.292 +
1.293 + void erase()
1.294 + {
1.295 + if (end || !hash || curbucket < 0 || curbucket >= static_cast<int>(hash->m_numBuckets))
1.296 + return;
1.297 +
1.298 + // Remove this element and move to the next one
1.299 + iterator tmp = *this;
1.300 + ++tmp;
1.301 + delete (*iter);
1.302 + hash->m_Buckets[curbucket]->erase(iter);
1.303 + *this = tmp;
1.304 +
1.305 + // :TODO: Maybe refactor to a lower size if required
1.306 + }
1.307 + private:
1.308 + void _Inc()
1.309 + {
1.310 + if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
1.311 + return;
1.312 + if (curbucket < 0)
1.313 + {
1.314 + for (int i=0; i<(int)hash->m_numBuckets; i++)
1.315 + {
1.316 + if (hash->m_Buckets[i])
1.317 + {
1.318 + iter = hash->m_Buckets[i]->begin();
1.319 + if (iter == hash->m_Buckets[i]->end())
1.320 + continue;
1.321 + curbucket = i;
1.322 + break;
1.323 + }
1.324 + }
1.325 + if (curbucket < 0)
1.326 + end = true;
1.327 + } else {
1.328 + if (iter != hash->m_Buckets[curbucket]->end())
1.329 + iter++;
1.330 + if (iter == hash->m_Buckets[curbucket]->end())
1.331 + {
1.332 + int oldbucket = curbucket;
1.333 + for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
1.334 + {
1.335 + if (hash->m_Buckets[i])
1.336 + {
1.337 + iter = hash->m_Buckets[i]->begin();
1.338 + if (iter == hash->m_Buckets[i]->end())
1.339 + continue;
1.340 + curbucket = i;
1.341 + break;
1.342 + }
1.343 + }
1.344 + if (curbucket == oldbucket)
1.345 + end = true;
1.346 + }
1.347 + }
1.348 + }
1.349 + private:
1.350 + int curbucket;
1.351 + typename SourceHook::List<THashNode *>::iterator iter;
1.352 + THash *hash;
1.353 + bool end;
1.354 + };
1.355 + class const_iterator
1.356 + {
1.357 + friend class THash;
1.358 + public:
1.359 + const_iterator() : curbucket(-1), hash(NULL), end(true)
1.360 + {
1.361 + };
1.362 + const_iterator(const THash *h) : curbucket(-1), hash(h), end(false)
1.363 + {
1.364 + if (!h->m_Buckets)
1.365 + end = true;
1.366 + else
1.367 + _Inc();
1.368 + };
1.369 + //pre increment
1.370 + const_iterator & operator++()
1.371 + {
1.372 + _Inc();
1.373 + return *this;
1.374 + }
1.375 + //post increment
1.376 + const_iterator operator++(int)
1.377 + {
1.378 + iterator old(*this);
1.379 + _Inc();
1.380 + return old;
1.381 + }
1.382 + const THashNode & operator * () const
1.383 + {
1.384 + return *(*iter);
1.385 + }
1.386 + const THashNode * operator ->() const
1.387 + {
1.388 + return (*iter);
1.389 + }
1.390 + bool operator ==(const const_iterator &where) const
1.391 + {
1.392 + if (where.hash == this->hash
1.393 + && where.end == this->end
1.394 + &&
1.395 + (this->end ||
1.396 + ((where.curbucket == this->curbucket)
1.397 + && (where.iter == iter))
1.398 + ))
1.399 + return true;
1.400 + return false;
1.401 + }
1.402 + bool operator !=(const const_iterator &where) const
1.403 + {
1.404 + return !( (*this) == where );
1.405 + }
1.406 + private:
1.407 + void _Inc()
1.408 + {
1.409 + if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
1.410 + return;
1.411 + if (curbucket < 0)
1.412 + {
1.413 + for (int i=0; i<(int)hash->m_numBuckets; i++)
1.414 + {
1.415 + if (hash->m_Buckets[i])
1.416 + {
1.417 + iter = hash->m_Buckets[i]->begin();
1.418 + if (iter == hash->m_Buckets[i]->end())
1.419 + continue;
1.420 + curbucket = i;
1.421 + break;
1.422 + }
1.423 + }
1.424 + if (curbucket < 0)
1.425 + end = true;
1.426 + } else {
1.427 + if (iter != hash->m_Buckets[curbucket]->end())
1.428 + iter++;
1.429 + if (iter == hash->m_Buckets[curbucket]->end())
1.430 + {
1.431 + int oldbucket = curbucket;
1.432 + for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
1.433 + {
1.434 + if (hash->m_Buckets[i])
1.435 + {
1.436 + iter = hash->m_Buckets[i]->begin();
1.437 + if (iter == hash->m_Buckets[i]->end())
1.438 + continue;
1.439 + curbucket = i;
1.440 + break;
1.441 + }
1.442 + }
1.443 + if (curbucket == oldbucket)
1.444 + end = true;
1.445 + }
1.446 + }
1.447 + }
1.448 + private:
1.449 + int curbucket;
1.450 + typename SourceHook::List<THashNode *>::iterator iter;
1.451 + const THash *hash;
1.452 + bool end;
1.453 + };
1.454 + public:
1.455 + iterator begin()
1.456 + {
1.457 + return iterator(this);
1.458 + }
1.459 + iterator end()
1.460 + {
1.461 + iterator iter;
1.462 + iter.hash = this;
1.463 + return iter;
1.464 + }
1.465 +
1.466 + const_iterator begin() const
1.467 + {
1.468 + return const_iterator(this);
1.469 + }
1.470 + const_iterator end() const
1.471 + {
1.472 + const_iterator iter;
1.473 + iter.hash = this;
1.474 + return iter;
1.475 + }
1.476 +
1.477 + template <typename U>
1.478 + iterator find(const U & u) const
1.479 + {
1.480 + iterator b = begin();
1.481 + iterator e = end();
1.482 + for (iterator iter = b; iter != e; iter++)
1.483 + {
1.484 + if ( (*iter).key == u )
1.485 + return iter;
1.486 + }
1.487 + return end();
1.488 + }
1.489 + template <typename U>
1.490 + iterator find(const U & u)
1.491 + {
1.492 + iterator b = begin();
1.493 + iterator e = end();
1.494 + for (iterator iter = b; iter != e; iter++)
1.495 + {
1.496 + if ( (*iter).key == u )
1.497 + return iter;
1.498 + }
1.499 + return end();
1.500 + }
1.501 + template <typename U>
1.502 + iterator FindAlt(const U & u)
1.503 + {
1.504 + iterator b = begin();
1.505 + iterator e = end();
1.506 + for (iterator iter = b; iter != e; iter++)
1.507 + {
1.508 + if (CompareAlt(u, (*iter).key) == 0)
1.509 + {
1.510 + return iter;
1.511 + }
1.512 + }
1.513 + return e;
1.514 + }
1.515 + iterator erase(iterator where)
1.516 + {
1.517 + where.erase();
1.518 + return where;
1.519 + }
1.520 + template <typename U>
1.521 + void erase(const U & u)
1.522 + {
1.523 + iterator iter = find(u);
1.524 + if (iter == end())
1.525 + return;
1.526 + iter.erase();
1.527 + }
1.528 + friend class iterator;
1.529 + friend class const_iterator;
1.530 + private:
1.531 + NodePtr *m_Buckets;
1.532 + size_t m_numBuckets;
1.533 + float m_percentUsed;
1.534 + };
1.535 +};
1.536 +
1.537 +#endif //_INCLUDE_SH_TINYHASH_H_