sourcehook/sh_tinyhash.h
author Pavol Marko <pavolmarko@gmail.com>
Fri Oct 14 20:57:43 2005 +0000 (2005-10-14)
changeset 134 a9e04855f582
parent 117 e322da4af2d2
child 150 22fbddfa0209
permissions -rw-r--r--
Faluco added new FastDelegate version, added more tests to testreentr
dvander@102
     1
/* ======== SourceMM ========
dvander@102
     2
* Copyright (C) 2004-2005 Metamod:Source Development Team
dvander@102
     3
* No warranties of any kind
dvander@102
     4
*
dvander@102
     5
* License: zlib/libpng
dvander@102
     6
*
dvander@102
     7
* Author(s): David "BAILOPAN" Anderson
dvander@102
     8
* ============================
dvander@102
     9
*/
dvander@102
    10
dvander@102
    11
#ifndef _INCLUDE_SH_TINYHASH_H_
dvander@102
    12
#define _INCLUDE_SH_TINYHASH_H_
dvander@102
    13
dvander@102
    14
#include "sh_list.h"
dvander@102
    15
dvander@102
    16
#define _T_INIT_HASH_SIZE	32
dvander@102
    17
dvander@102
    18
namespace SourceHook
dvander@102
    19
{
dvander@102
    20
	template <class K>
dvander@102
    21
	int HashFunction(const K & k);
dvander@102
    22
dvander@102
    23
	template <class K>
dvander@102
    24
	int Compare(const K & k1, const K & k2);
dvander@102
    25
dvander@102
    26
	/**
dvander@102
    27
	 * This is a tiny, growable hash class.
dvander@102
    28
	 * Meant for quick and dirty dictionaries only!
dvander@102
    29
	 */
pavolmarko@117
    30
	template <class K, class V>
dvander@102
    31
	class THash
dvander@102
    32
	{
dvander@102
    33
	public:
dvander@102
    34
		struct THashNode
dvander@102
    35
		{
pavolmarko@117
    36
			THashNode(const K & k, const V & v) :
dvander@102
    37
				key(k), val(v)
dvander@102
    38
				{
dvander@102
    39
				};
dvander@102
    40
			K key;
dvander@102
    41
			V val;
dvander@102
    42
		};
dvander@102
    43
		typedef List<THashNode *> *	NodePtr;
dvander@102
    44
	public:
pavolmarko@111
    45
		THash() : m_Buckets(NULL), m_numBuckets(0), m_percentUsed(0.0f)
pavolmarko@111
    46
		{
pavolmarko@111
    47
			_Refactor();
pavolmarko@111
    48
		}
pavolmarko@111
    49
		THash(const THash &other) : m_Buckets(new NodePtr[other.m_numBuckets]),
pavolmarko@111
    50
			m_numBuckets(other.m_numBuckets), m_percentUsed(other.m_percentUsed)
pavolmarko@111
    51
		{
pavolmarko@111
    52
			for (size_t i=0; i<m_numBuckets; i++)
pavolmarko@111
    53
					m_Buckets[i] = NULL;
pavolmarko@111
    54
			for (const_iterator iter = other.begin(); iter != other.end(); ++iter)
pavolmarko@111
    55
				_FindOrInsert(iter->key)->val = iter->val;
pavolmarko@111
    56
		}
pavolmarko@111
    57
		void operator=(const THash &other)
dvander@102
    58
		{
pavolmarko@111
    59
			clear();
pavolmarko@111
    60
			for (const_iterator iter = other.begin(); iter != other.end(); ++iter)
pavolmarko@111
    61
				_FindOrInsert(iter->key)->val = iter->val;
pavolmarko@111
    62
		}
pavolmarko@111
    63
pavolmarko@111
    64
		~THash()
pavolmarko@111
    65
		{
dvander@115
    66
			_Clear();
pavolmarko@111
    67
		}
pavolmarko@111
    68
		void clear()
pavolmarko@111
    69
		{
dvander@115
    70
			_Clear();
dvander@102
    71
			_Refactor();
dvander@102
    72
		}
dvander@102
    73
		size_t GetBuckets()
dvander@102
    74
		{
dvander@102
    75
			return m_numBuckets;
dvander@102
    76
		}
dvander@102
    77
		float PercentUsed()
dvander@102
    78
		{
dvander@102
    79
			return m_percentUsed;
dvander@102
    80
		}
dvander@102
    81
		V & operator [](const K & key)
dvander@102
    82
		{
dvander@102
    83
			THashNode *pNode = _FindOrInsert(key);
dvander@102
    84
			return pNode->val;
dvander@102
    85
		}
dvander@102
    86
	private:
dvander@115
    87
		void _Clear()
dvander@115
    88
		{
dvander@115
    89
			for (size_t i=0; i<m_numBuckets; i++)
dvander@115
    90
			{
dvander@115
    91
				if (m_Buckets[i])
dvander@115
    92
				{
dvander@115
    93
					delete m_Buckets[i];
dvander@115
    94
					m_Buckets[i] = NULL;
dvander@115
    95
				}
dvander@115
    96
			}
dvander@115
    97
			if (m_Buckets)
dvander@115
    98
				delete [] m_Buckets;
dvander@115
    99
			m_Buckets = NULL;
dvander@115
   100
			m_numBuckets = 0;
dvander@115
   101
		}
dvander@102
   102
		THashNode *_FindOrInsert(const K & key)
dvander@102
   103
		{
dvander@102
   104
			size_t place = HashFunction(key) % m_numBuckets;
dvander@102
   105
			THashNode *pNode = NULL;
dvander@102
   106
			if (!m_Buckets[place])
dvander@102
   107
			{
dvander@102
   108
				m_Buckets[place] = new List<THashNode *>;
dvander@102
   109
				pNode = new THashNode(key, V());
dvander@102
   110
				m_Buckets[place]->push_back(pNode);
dvander@102
   111
				m_percentUsed += (1.0f / (float)m_numBuckets);
dvander@102
   112
			} else {
dvander@107
   113
				typename List<THashNode *>::iterator iter;
dvander@102
   114
				for (iter=m_Buckets[place]->begin(); iter!=m_Buckets[place]->end(); iter++)
dvander@102
   115
				{
dvander@102
   116
					if (Compare((*iter)->key, key) == 0)
dvander@102
   117
						return (*iter);
dvander@102
   118
				}
dvander@102
   119
				//node does not exist
dvander@102
   120
				pNode = new THashNode(key, V());
dvander@102
   121
				m_Buckets[place]->push_back(pNode);
dvander@102
   122
			}
dvander@102
   123
			if (PercentUsed() > 0.75f)
dvander@102
   124
				_Refactor();
dvander@102
   125
			return pNode;
dvander@102
   126
		}
dvander@102
   127
		void _Refactor()
dvander@102
   128
		{
dvander@102
   129
			m_percentUsed = 0.0f;
dvander@102
   130
			if (!m_numBuckets)
dvander@102
   131
			{
dvander@102
   132
				m_numBuckets = _T_INIT_HASH_SIZE;
dvander@102
   133
				m_Buckets = new NodePtr[m_numBuckets];
dvander@102
   134
				for (size_t i=0; i<m_numBuckets; i++)
dvander@102
   135
					m_Buckets[i] = NULL;
dvander@102
   136
			} else {
dvander@102
   137
				size_t oldSize = m_numBuckets;
dvander@102
   138
				m_numBuckets *= 2;
dvander@107
   139
				typename List<THashNode *>::iterator iter;
dvander@102
   140
				size_t place;
dvander@102
   141
				THashNode *pHashNode;
pavolmarko@117
   142
				NodePtr *temp = new NodePtr[m_numBuckets];
dvander@102
   143
				for (size_t i=0; i<m_numBuckets; i++)
dvander@102
   144
					temp[i] = NULL;
dvander@102
   145
				//look in old hash table
dvander@102
   146
				for (size_t i=0; i<oldSize; i++)
dvander@102
   147
				{
dvander@102
   148
					//does a bucket have anything?
dvander@102
   149
					if (m_Buckets[i])
dvander@102
   150
					{
dvander@102
   151
						//go through the list of items
dvander@102
   152
						for (iter = m_Buckets[i]->begin(); iter != m_Buckets[i]->end(); iter++)
dvander@102
   153
						{
dvander@102
   154
							pHashNode = (*iter);
dvander@102
   155
							//rehash it with the new bucket filter
dvander@102
   156
							place = HashFunction(pHashNode->key) % m_numBuckets;
dvander@102
   157
							//add it to the new hash table
dvander@102
   158
							if (!temp[place])
dvander@102
   159
							{
dvander@102
   160
								temp[place] = new List<THashNode *>;
dvander@102
   161
								m_percentUsed += (1.0f / (float)m_numBuckets);
dvander@102
   162
							}
dvander@102
   163
							temp[place]->push_back(pHashNode);
dvander@102
   164
						}
dvander@102
   165
						//delete that bucket!
dvander@102
   166
						delete m_Buckets[i];
dvander@102
   167
						m_Buckets[i] = NULL;
dvander@102
   168
					}
dvander@102
   169
				}
dvander@102
   170
				//reassign bucket table
dvander@102
   171
				delete [] m_Buckets;
dvander@102
   172
				m_Buckets = temp;
dvander@102
   173
			}
dvander@102
   174
		}
dvander@102
   175
	public:
dvander@102
   176
		friend class iterator;
pavolmarko@111
   177
		friend class const_iterator;
dvander@102
   178
		class iterator
dvander@102
   179
		{
dvander@102
   180
			friend class THash;
dvander@102
   181
		public:
pavolmarko@111
   182
			iterator() : curbucket(-1), hash(NULL), end(true)
dvander@102
   183
			{
dvander@102
   184
			};
pavolmarko@111
   185
			iterator(THash *h) : curbucket(-1), hash(h), end(false)
dvander@102
   186
			{
dvander@102
   187
				if (!h->m_Buckets)
dvander@102
   188
					end = true;
dvander@102
   189
				else
dvander@102
   190
					_Inc();
dvander@102
   191
			};
dvander@102
   192
			//pre increment
dvander@102
   193
			iterator & operator++()
dvander@102
   194
			{
dvander@102
   195
				_Inc();
dvander@102
   196
				return *this;
dvander@102
   197
			}
dvander@102
   198
			//post increment
dvander@102
   199
			iterator operator++(int)
dvander@102
   200
			{
dvander@102
   201
				iterator old(*this);
dvander@102
   202
				_Inc();
dvander@102
   203
				return old;
dvander@102
   204
			}
pavolmarko@111
   205
			const THashNode & operator * () const
dvander@102
   206
			{
dvander@102
   207
				return *(*iter);
dvander@102
   208
			}
dvander@102
   209
			THashNode & operator * ()
dvander@102
   210
			{
dvander@102
   211
				return *(*iter);
dvander@102
   212
			}
pavolmarko@111
   213
			const THashNode * operator ->() const
dvander@102
   214
			{
dvander@102
   215
				return (*iter);
dvander@102
   216
			}
dvander@102
   217
			THashNode * operator ->()
dvander@102
   218
			{
dvander@102
   219
				return (*iter);
dvander@102
   220
			}
dvander@102
   221
			bool operator ==(const iterator &where) const
dvander@102
   222
			{
dvander@102
   223
				if (where.hash == this->hash
dvander@102
   224
					&& where.end == this->end
pavolmarko@117
   225
					&&
pavolmarko@117
   226
					 (this->end ||
pavolmarko@117
   227
					   ((where.curbucket == this->curbucket)
pavolmarko@117
   228
						&& (where.iter == iter))
dvander@102
   229
						 ))
dvander@102
   230
					return true;
dvander@102
   231
				return false;
dvander@102
   232
			}
dvander@102
   233
			bool operator !=(const iterator &where) const
dvander@102
   234
			{
dvander@102
   235
				return !( (*this) == where );
dvander@102
   236
			}
pavolmarko@117
   237
pavolmarko@117
   238
			void erase()
pavolmarko@117
   239
			{
pavolmarko@117
   240
				if (end || !hash || curbucket < 0 || curbucket >= static_cast<int>(hash->m_numBuckets))
pavolmarko@117
   241
					return;
pavolmarko@117
   242
pavolmarko@117
   243
				// Remove this element and move to the next one
pavolmarko@117
   244
				iterator tmp = *this;
pavolmarko@117
   245
				++tmp;
pavolmarko@117
   246
				hash->m_Buckets[curbucket]->erase(iter);
pavolmarko@117
   247
				*this = tmp;
pavolmarko@117
   248
pavolmarko@117
   249
				// :TODO: Maybe refactor to a lower size if required
pavolmarko@117
   250
			}
dvander@102
   251
		private:
dvander@102
   252
			void _Inc()
dvander@102
   253
			{
pavolmarko@111
   254
				if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
dvander@102
   255
					return;
dvander@102
   256
				if (curbucket < 0)
dvander@102
   257
				{
dvander@102
   258
					for (int i=0; i<(int)hash->m_numBuckets; i++)
dvander@102
   259
					{
dvander@102
   260
						if (hash->m_Buckets[i])
dvander@102
   261
						{
dvander@102
   262
							iter = hash->m_Buckets[i]->begin();
dvander@102
   263
							if (iter == hash->m_Buckets[i]->end())
dvander@102
   264
								continue;
dvander@102
   265
							curbucket = i;
dvander@102
   266
							break;
dvander@102
   267
						}
dvander@102
   268
					}
dvander@102
   269
					if (curbucket < 0)
dvander@102
   270
						end = true;
dvander@102
   271
				} else {
dvander@102
   272
					if (iter != hash->m_Buckets[curbucket]->end())
dvander@102
   273
						iter++;
dvander@102
   274
					if (iter == hash->m_Buckets[curbucket]->end())
dvander@102
   275
					{
dvander@102
   276
						int oldbucket = curbucket;
dvander@102
   277
						for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
dvander@102
   278
						{
dvander@102
   279
							if (hash->m_Buckets[i])
dvander@102
   280
							{
dvander@102
   281
								iter = hash->m_Buckets[i]->begin();
dvander@102
   282
								if (iter == hash->m_Buckets[i]->end())
dvander@102
   283
									continue;
dvander@102
   284
								curbucket = i;
dvander@102
   285
								break;
dvander@102
   286
							}
dvander@102
   287
						}
dvander@102
   288
						if (curbucket == oldbucket)
dvander@102
   289
							end = true;
dvander@102
   290
					}
dvander@102
   291
				}
dvander@102
   292
			}
dvander@102
   293
		private:
dvander@102
   294
			int curbucket;
dvander@102
   295
			typename SourceHook::List<THashNode *>::iterator iter;
dvander@102
   296
			THash *hash;
dvander@102
   297
			bool end;
dvander@102
   298
		};
pavolmarko@111
   299
		class const_iterator
pavolmarko@111
   300
		{
pavolmarko@111
   301
			friend class THash;
pavolmarko@111
   302
		public:
pavolmarko@111
   303
			const_iterator() : curbucket(-1), hash(NULL), end(true)
pavolmarko@111
   304
			{
pavolmarko@111
   305
			};
pavolmarko@111
   306
			const_iterator(const THash *h) : curbucket(-1), hash(h), end(false)
pavolmarko@111
   307
			{
pavolmarko@111
   308
				if (!h->m_Buckets)
pavolmarko@111
   309
					end = true;
pavolmarko@111
   310
				else
pavolmarko@111
   311
					_Inc();
pavolmarko@111
   312
			};
pavolmarko@111
   313
			//pre increment
pavolmarko@111
   314
			const_iterator & operator++()
pavolmarko@111
   315
			{
pavolmarko@111
   316
				_Inc();
pavolmarko@111
   317
				return *this;
pavolmarko@111
   318
			}
pavolmarko@111
   319
			//post increment
pavolmarko@111
   320
			const_iterator operator++(int)
pavolmarko@111
   321
			{
pavolmarko@111
   322
				iterator old(*this);
pavolmarko@111
   323
				_Inc();
pavolmarko@111
   324
				return old;
pavolmarko@111
   325
			}
pavolmarko@111
   326
			const THashNode & operator * () const
pavolmarko@111
   327
			{
pavolmarko@111
   328
				return *(*iter);
pavolmarko@111
   329
			}
pavolmarko@111
   330
			const THashNode * operator ->() const
pavolmarko@111
   331
			{
pavolmarko@111
   332
				return (*iter);
pavolmarko@111
   333
			}
pavolmarko@111
   334
			bool operator ==(const const_iterator &where) const
pavolmarko@111
   335
			{
pavolmarko@111
   336
				if (where.hash == this->hash
pavolmarko@111
   337
					&& where.end == this->end
pavolmarko@117
   338
					&&
pavolmarko@117
   339
					 (this->end ||
pavolmarko@117
   340
					   ((where.curbucket == this->curbucket)
pavolmarko@117
   341
						&& (where.iter == iter))
pavolmarko@111
   342
						 ))
pavolmarko@111
   343
					return true;
pavolmarko@111
   344
				return false;
pavolmarko@111
   345
			}
pavolmarko@111
   346
			bool operator !=(const const_iterator &where) const
pavolmarko@111
   347
			{
pavolmarko@111
   348
				return !( (*this) == where );
pavolmarko@111
   349
			}
pavolmarko@111
   350
		private:
pavolmarko@111
   351
			void _Inc()
pavolmarko@111
   352
			{
pavolmarko@111
   353
				if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
pavolmarko@111
   354
					return;
pavolmarko@111
   355
				if (curbucket < 0)
pavolmarko@111
   356
				{
pavolmarko@111
   357
					for (int i=0; i<(int)hash->m_numBuckets; i++)
pavolmarko@111
   358
					{
pavolmarko@111
   359
						if (hash->m_Buckets[i])
pavolmarko@111
   360
						{
pavolmarko@111
   361
							iter = hash->m_Buckets[i]->begin();
pavolmarko@111
   362
							if (iter == hash->m_Buckets[i]->end())
pavolmarko@111
   363
								continue;
pavolmarko@111
   364
							curbucket = i;
pavolmarko@111
   365
							break;
pavolmarko@111
   366
						}
pavolmarko@111
   367
					}
pavolmarko@111
   368
					if (curbucket < 0)
pavolmarko@111
   369
						end = true;
pavolmarko@111
   370
				} else {
pavolmarko@111
   371
					if (iter != hash->m_Buckets[curbucket]->end())
pavolmarko@111
   372
						iter++;
pavolmarko@111
   373
					if (iter == hash->m_Buckets[curbucket]->end())
pavolmarko@111
   374
					{
pavolmarko@111
   375
						int oldbucket = curbucket;
pavolmarko@111
   376
						for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
pavolmarko@111
   377
						{
pavolmarko@111
   378
							if (hash->m_Buckets[i])
pavolmarko@111
   379
							{
pavolmarko@111
   380
								iter = hash->m_Buckets[i]->begin();
pavolmarko@111
   381
								if (iter == hash->m_Buckets[i]->end())
pavolmarko@111
   382
									continue;
pavolmarko@111
   383
								curbucket = i;
pavolmarko@111
   384
								break;
pavolmarko@111
   385
							}
pavolmarko@111
   386
						}
pavolmarko@111
   387
						if (curbucket == oldbucket)
pavolmarko@111
   388
							end = true;
pavolmarko@111
   389
					}
pavolmarko@111
   390
				}
pavolmarko@111
   391
			}
pavolmarko@111
   392
		private:
pavolmarko@111
   393
			int curbucket;
pavolmarko@111
   394
			typename SourceHook::List<THashNode *>::iterator iter;
pavolmarko@111
   395
			const THash *hash;
pavolmarko@111
   396
			bool end;
pavolmarko@111
   397
		};
dvander@102
   398
	public:
dvander@102
   399
		iterator begin()
dvander@102
   400
		{
dvander@102
   401
			return iterator(this);
dvander@102
   402
		}
dvander@102
   403
		iterator end()
dvander@102
   404
		{
dvander@102
   405
			iterator iter;
dvander@102
   406
			iter.hash = this;
dvander@102
   407
			return iter;
dvander@102
   408
		}
pavolmarko@117
   409
pavolmarko@111
   410
		const_iterator begin() const
pavolmarko@111
   411
		{
pavolmarko@111
   412
			return const_iterator(this);
pavolmarko@111
   413
		}
pavolmarko@111
   414
		const_iterator end() const
pavolmarko@111
   415
		{
pavolmarko@111
   416
			const_iterator iter;
pavolmarko@111
   417
			iter.hash = this;
pavolmarko@111
   418
			return iter;
pavolmarko@111
   419
		}
pavolmarko@117
   420
dvander@102
   421
		template <typename U>
dvander@102
   422
		iterator find(const U & u) const
dvander@102
   423
		{
dvander@102
   424
			iterator b = begin();
dvander@102
   425
			iterator e = end();
dvander@102
   426
			for (iterator iter = b; iter != e; iter++)
dvander@102
   427
			{
dvander@102
   428
				if ( (*iter).key == u )
dvander@102
   429
					return iter;
dvander@102
   430
			}
dvander@102
   431
			return end();
dvander@102
   432
		}
dvander@102
   433
		template <typename U>
dvander@102
   434
		iterator find(const U & u)
dvander@102
   435
		{
dvander@102
   436
			iterator b = begin();
dvander@102
   437
			iterator e = end();
dvander@102
   438
			for (iterator iter = b; iter != e; iter++)
dvander@102
   439
			{
dvander@102
   440
				if ( (*iter).key == u )
dvander@102
   441
					return iter;
dvander@102
   442
			}
dvander@102
   443
			return end();
dvander@102
   444
		}
pavolmarko@117
   445
pavolmarko@117
   446
		iterator erase(iterator where)
pavolmarko@117
   447
		{
pavolmarko@117
   448
			where.erase();
pavolmarko@117
   449
			return where;
pavolmarko@117
   450
		}
pavolmarko@117
   451
		template <typename U>
pavolmarko@117
   452
		void erase(const U & u)
pavolmarko@117
   453
		{
pavolmarko@117
   454
			iterator iter = find(u);
pavolmarko@117
   455
			if (iter == end())
pavolmarko@117
   456
				return;
pavolmarko@117
   457
			iter.erase();
pavolmarko@117
   458
		}
dvander@102
   459
	private:
dvander@102
   460
		NodePtr	*m_Buckets;
dvander@102
   461
		size_t m_numBuckets;
dvander@102
   462
		float m_percentUsed;
dvander@102
   463
	};
dvander@102
   464
};
dvander@102
   465
dvander@102
   466
#endif //_INCLUDE_SH_TINYHASH_H_