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