sourcehook/sh_tinyhash.h
author Pavol Marko <pavolmarko@gmail.com>
Sat Sep 24 15:27:03 2005 +0000 (2005-09-24)
changeset 112 0260e74b4a5d
parent 111 aec58c99dafc
child 115 6d0d182ef25c
permissions -rw-r--r--
Hello.
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
	 */
dvander@102
    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
		{
dvander@102
    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
		{
pavolmarko@111
    66
			if (m_Buckets)
pavolmarko@111
    67
				delete [] m_Buckets;
pavolmarko@111
    68
		}
pavolmarko@111
    69
		void clear()
pavolmarko@111
    70
		{
pavolmarko@111
    71
			if (m_Buckets)
pavolmarko@111
    72
				delete [] m_Buckets;
pavolmarko@111
    73
			m_Buckets = NULL;
pavolmarko@111
    74
			m_numBuckets = 0;
pavolmarko@111
    75
			m_percentUsed = 0.0f;
pavolmarko@111
    76
			
dvander@102
    77
			_Refactor();
dvander@102
    78
		}
dvander@102
    79
		size_t GetBuckets()
dvander@102
    80
		{
dvander@102
    81
			return m_numBuckets;
dvander@102
    82
		}
dvander@102
    83
		float PercentUsed()
dvander@102
    84
		{
dvander@102
    85
			return m_percentUsed;
dvander@102
    86
		}
dvander@102
    87
		V & operator [](const K & key)
dvander@102
    88
		{
dvander@102
    89
			THashNode *pNode = _FindOrInsert(key);
dvander@102
    90
			return pNode->val;
dvander@102
    91
		}
dvander@102
    92
	private:
dvander@102
    93
		THashNode *_FindOrInsert(const K & key)
dvander@102
    94
		{
dvander@102
    95
			size_t place = HashFunction(key) % m_numBuckets;
dvander@102
    96
			THashNode *pNode = NULL;
dvander@102
    97
			if (!m_Buckets[place])
dvander@102
    98
			{
dvander@102
    99
				m_Buckets[place] = new List<THashNode *>;
dvander@102
   100
				pNode = new THashNode(key, V());
dvander@102
   101
				m_Buckets[place]->push_back(pNode);
dvander@102
   102
				m_percentUsed += (1.0f / (float)m_numBuckets);
dvander@102
   103
			} else {
dvander@107
   104
				typename List<THashNode *>::iterator iter;
dvander@102
   105
				for (iter=m_Buckets[place]->begin(); iter!=m_Buckets[place]->end(); iter++)
dvander@102
   106
				{
dvander@102
   107
					if (Compare((*iter)->key, key) == 0)
dvander@102
   108
						return (*iter);
dvander@102
   109
				}
dvander@102
   110
				//node does not exist
dvander@102
   111
				pNode = new THashNode(key, V());
dvander@102
   112
				m_Buckets[place]->push_back(pNode);
dvander@102
   113
			}
dvander@102
   114
			if (PercentUsed() > 0.75f)
dvander@102
   115
				_Refactor();
dvander@102
   116
			return pNode;
dvander@102
   117
		}
dvander@102
   118
		void _Refactor()
dvander@102
   119
		{
dvander@102
   120
			m_percentUsed = 0.0f;
dvander@102
   121
			if (!m_numBuckets)
dvander@102
   122
			{
dvander@102
   123
				m_numBuckets = _T_INIT_HASH_SIZE;
dvander@102
   124
				m_Buckets = new NodePtr[m_numBuckets];
dvander@102
   125
				for (size_t i=0; i<m_numBuckets; i++)
dvander@102
   126
					m_Buckets[i] = NULL;
dvander@102
   127
			} else {
dvander@102
   128
				size_t oldSize = m_numBuckets;
dvander@102
   129
				m_numBuckets *= 2;
dvander@107
   130
				typename List<THashNode *>::iterator iter;
dvander@102
   131
				size_t place;
dvander@102
   132
				THashNode *pHashNode;
dvander@102
   133
                NodePtr *temp = new NodePtr[m_numBuckets];
dvander@102
   134
				for (size_t i=0; i<m_numBuckets; i++)
dvander@102
   135
					temp[i] = NULL;
dvander@102
   136
				//look in old hash table
dvander@102
   137
				for (size_t i=0; i<oldSize; i++)
dvander@102
   138
				{
dvander@102
   139
					//does a bucket have anything?
dvander@102
   140
					if (m_Buckets[i])
dvander@102
   141
					{
dvander@102
   142
						//go through the list of items
dvander@102
   143
						for (iter = m_Buckets[i]->begin(); iter != m_Buckets[i]->end(); iter++)
dvander@102
   144
						{
dvander@102
   145
							pHashNode = (*iter);
dvander@102
   146
							//rehash it with the new bucket filter
dvander@102
   147
							place = HashFunction(pHashNode->key) % m_numBuckets;
dvander@102
   148
							//add it to the new hash table
dvander@102
   149
							if (!temp[place])
dvander@102
   150
							{
dvander@102
   151
								temp[place] = new List<THashNode *>;
dvander@102
   152
								m_percentUsed += (1.0f / (float)m_numBuckets);
dvander@102
   153
							}
dvander@102
   154
							temp[place]->push_back(pHashNode);
dvander@102
   155
						}
dvander@102
   156
						//delete that bucket!
dvander@102
   157
						delete m_Buckets[i];
dvander@102
   158
						m_Buckets[i] = NULL;
dvander@102
   159
					}
dvander@102
   160
				}
dvander@102
   161
				//reassign bucket table
dvander@102
   162
				delete [] m_Buckets;
dvander@102
   163
				m_Buckets = temp;
dvander@102
   164
			}
dvander@102
   165
		}
dvander@102
   166
	public:
dvander@102
   167
		friend class iterator;
pavolmarko@111
   168
		friend class const_iterator;
dvander@102
   169
		class iterator
dvander@102
   170
		{
dvander@102
   171
			friend class THash;
dvander@102
   172
		public:
pavolmarko@111
   173
			iterator() : curbucket(-1), hash(NULL), end(true)
dvander@102
   174
			{
dvander@102
   175
			};
pavolmarko@111
   176
			iterator(THash *h) : curbucket(-1), hash(h), end(false)
dvander@102
   177
			{
dvander@102
   178
				if (!h->m_Buckets)
dvander@102
   179
					end = true;
dvander@102
   180
				else
dvander@102
   181
					_Inc();
dvander@102
   182
			};
dvander@102
   183
			//pre increment
dvander@102
   184
			iterator & operator++()
dvander@102
   185
			{
dvander@102
   186
				_Inc();
dvander@102
   187
				return *this;
dvander@102
   188
			}
dvander@102
   189
			//post increment
dvander@102
   190
			iterator operator++(int)
dvander@102
   191
			{
dvander@102
   192
				iterator old(*this);
dvander@102
   193
				_Inc();
dvander@102
   194
				return old;
dvander@102
   195
			}
pavolmarko@111
   196
			const THashNode & operator * () const
dvander@102
   197
			{
dvander@102
   198
				return *(*iter);
dvander@102
   199
			}
dvander@102
   200
			THashNode & operator * ()
dvander@102
   201
			{
dvander@102
   202
				return *(*iter);
dvander@102
   203
			}
pavolmarko@111
   204
			const THashNode * operator ->() const
dvander@102
   205
			{
dvander@102
   206
				return (*iter);
dvander@102
   207
			}
dvander@102
   208
			THashNode * operator ->()
dvander@102
   209
			{
dvander@102
   210
				return (*iter);
dvander@102
   211
			}
dvander@102
   212
			bool operator ==(const iterator &where) const
dvander@102
   213
			{
dvander@102
   214
				if (where.hash == this->hash
dvander@102
   215
					&& where.end == this->end
dvander@102
   216
					&& 
dvander@102
   217
					 (this->end || 
dvander@102
   218
					   ((where.curbucket == this->curbucket) 
dvander@102
   219
					     && (where.iter == iter))
dvander@102
   220
						 ))
dvander@102
   221
					return true;
dvander@102
   222
				return false;
dvander@102
   223
			}
dvander@102
   224
			bool operator !=(const iterator &where) const
dvander@102
   225
			{
dvander@102
   226
				return !( (*this) == where );
dvander@102
   227
			}
dvander@102
   228
		private:
dvander@102
   229
			void _Inc()
dvander@102
   230
			{
pavolmarko@111
   231
				if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
dvander@102
   232
					return;
dvander@102
   233
				if (curbucket < 0)
dvander@102
   234
				{
dvander@102
   235
					for (int i=0; i<(int)hash->m_numBuckets; i++)
dvander@102
   236
					{
dvander@102
   237
						if (hash->m_Buckets[i])
dvander@102
   238
						{
dvander@102
   239
							iter = hash->m_Buckets[i]->begin();
dvander@102
   240
							if (iter == hash->m_Buckets[i]->end())
dvander@102
   241
								continue;
dvander@102
   242
							curbucket = i;
dvander@102
   243
							break;
dvander@102
   244
						}
dvander@102
   245
					}
dvander@102
   246
					if (curbucket < 0)
dvander@102
   247
						end = true;
dvander@102
   248
				} else {
dvander@102
   249
					if (iter != hash->m_Buckets[curbucket]->end())
dvander@102
   250
						iter++;
dvander@102
   251
					if (iter == hash->m_Buckets[curbucket]->end())
dvander@102
   252
					{
dvander@102
   253
						int oldbucket = curbucket;
dvander@102
   254
						for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
dvander@102
   255
						{
dvander@102
   256
							if (hash->m_Buckets[i])
dvander@102
   257
							{
dvander@102
   258
								iter = hash->m_Buckets[i]->begin();
dvander@102
   259
								if (iter == hash->m_Buckets[i]->end())
dvander@102
   260
									continue;
dvander@102
   261
								curbucket = i;
dvander@102
   262
								break;
dvander@102
   263
							}
dvander@102
   264
						}
dvander@102
   265
						if (curbucket == oldbucket)
dvander@102
   266
							end = true;
dvander@102
   267
					}
dvander@102
   268
				}
dvander@102
   269
			}
dvander@102
   270
		private:
dvander@102
   271
			int curbucket;
dvander@102
   272
			typename SourceHook::List<THashNode *>::iterator iter;
dvander@102
   273
			THash *hash;
dvander@102
   274
			bool end;
dvander@102
   275
		};
pavolmarko@111
   276
		class const_iterator
pavolmarko@111
   277
		{
pavolmarko@111
   278
			friend class THash;
pavolmarko@111
   279
		public:
pavolmarko@111
   280
			const_iterator() : curbucket(-1), hash(NULL), end(true)
pavolmarko@111
   281
			{
pavolmarko@111
   282
			};
pavolmarko@111
   283
			const_iterator(const THash *h) : curbucket(-1), hash(h), end(false)
pavolmarko@111
   284
			{
pavolmarko@111
   285
				if (!h->m_Buckets)
pavolmarko@111
   286
					end = true;
pavolmarko@111
   287
				else
pavolmarko@111
   288
					_Inc();
pavolmarko@111
   289
			};
pavolmarko@111
   290
			//pre increment
pavolmarko@111
   291
			const_iterator & operator++()
pavolmarko@111
   292
			{
pavolmarko@111
   293
				_Inc();
pavolmarko@111
   294
				return *this;
pavolmarko@111
   295
			}
pavolmarko@111
   296
			//post increment
pavolmarko@111
   297
			const_iterator operator++(int)
pavolmarko@111
   298
			{
pavolmarko@111
   299
				iterator old(*this);
pavolmarko@111
   300
				_Inc();
pavolmarko@111
   301
				return old;
pavolmarko@111
   302
			}
pavolmarko@111
   303
			const THashNode & operator * () const
pavolmarko@111
   304
			{
pavolmarko@111
   305
				return *(*iter);
pavolmarko@111
   306
			}
pavolmarko@111
   307
			const THashNode * operator ->() const
pavolmarko@111
   308
			{
pavolmarko@111
   309
				return (*iter);
pavolmarko@111
   310
			}
pavolmarko@111
   311
			bool operator ==(const const_iterator &where) const
pavolmarko@111
   312
			{
pavolmarko@111
   313
				if (where.hash == this->hash
pavolmarko@111
   314
					&& where.end == this->end
pavolmarko@111
   315
					&& 
pavolmarko@111
   316
					 (this->end || 
pavolmarko@111
   317
					   ((where.curbucket == this->curbucket) 
pavolmarko@111
   318
					     && (where.iter == iter))
pavolmarko@111
   319
						 ))
pavolmarko@111
   320
					return true;
pavolmarko@111
   321
				return false;
pavolmarko@111
   322
			}
pavolmarko@111
   323
			bool operator !=(const const_iterator &where) const
pavolmarko@111
   324
			{
pavolmarko@111
   325
				return !( (*this) == where );
pavolmarko@111
   326
			}
pavolmarko@111
   327
		private:
pavolmarko@111
   328
			void _Inc()
pavolmarko@111
   329
			{
pavolmarko@111
   330
				if (end || !hash || curbucket >= static_cast<int>(hash->m_numBuckets))
pavolmarko@111
   331
					return;
pavolmarko@111
   332
				if (curbucket < 0)
pavolmarko@111
   333
				{
pavolmarko@111
   334
					for (int i=0; i<(int)hash->m_numBuckets; i++)
pavolmarko@111
   335
					{
pavolmarko@111
   336
						if (hash->m_Buckets[i])
pavolmarko@111
   337
						{
pavolmarko@111
   338
							iter = hash->m_Buckets[i]->begin();
pavolmarko@111
   339
							if (iter == hash->m_Buckets[i]->end())
pavolmarko@111
   340
								continue;
pavolmarko@111
   341
							curbucket = i;
pavolmarko@111
   342
							break;
pavolmarko@111
   343
						}
pavolmarko@111
   344
					}
pavolmarko@111
   345
					if (curbucket < 0)
pavolmarko@111
   346
						end = true;
pavolmarko@111
   347
				} else {
pavolmarko@111
   348
					if (iter != hash->m_Buckets[curbucket]->end())
pavolmarko@111
   349
						iter++;
pavolmarko@111
   350
					if (iter == hash->m_Buckets[curbucket]->end())
pavolmarko@111
   351
					{
pavolmarko@111
   352
						int oldbucket = curbucket;
pavolmarko@111
   353
						for (int i=curbucket+1; i<(int)hash->m_numBuckets; i++)
pavolmarko@111
   354
						{
pavolmarko@111
   355
							if (hash->m_Buckets[i])
pavolmarko@111
   356
							{
pavolmarko@111
   357
								iter = hash->m_Buckets[i]->begin();
pavolmarko@111
   358
								if (iter == hash->m_Buckets[i]->end())
pavolmarko@111
   359
									continue;
pavolmarko@111
   360
								curbucket = i;
pavolmarko@111
   361
								break;
pavolmarko@111
   362
							}
pavolmarko@111
   363
						}
pavolmarko@111
   364
						if (curbucket == oldbucket)
pavolmarko@111
   365
							end = true;
pavolmarko@111
   366
					}
pavolmarko@111
   367
				}
pavolmarko@111
   368
			}
pavolmarko@111
   369
		private:
pavolmarko@111
   370
			int curbucket;
pavolmarko@111
   371
			typename SourceHook::List<THashNode *>::iterator iter;
pavolmarko@111
   372
			const THash *hash;
pavolmarko@111
   373
			bool end;
pavolmarko@111
   374
		};
dvander@102
   375
	public:
dvander@102
   376
		iterator begin()
dvander@102
   377
		{
dvander@102
   378
			return iterator(this);
dvander@102
   379
		}
dvander@102
   380
		iterator end()
dvander@102
   381
		{
dvander@102
   382
			iterator iter;
dvander@102
   383
			iter.hash = this;
dvander@102
   384
			return iter;
dvander@102
   385
		}
pavolmarko@111
   386
		
pavolmarko@111
   387
		const_iterator begin() const
pavolmarko@111
   388
		{
pavolmarko@111
   389
			return const_iterator(this);
pavolmarko@111
   390
		}
pavolmarko@111
   391
		const_iterator end() const
pavolmarko@111
   392
		{
pavolmarko@111
   393
			const_iterator iter;
pavolmarko@111
   394
			iter.hash = this;
pavolmarko@111
   395
			return iter;
pavolmarko@111
   396
		}
pavolmarko@111
   397
		
dvander@102
   398
		template <typename U>
dvander@102
   399
		iterator find(const U & u) const
dvander@102
   400
		{
dvander@102
   401
			iterator b = begin();
dvander@102
   402
			iterator e = end();
dvander@102
   403
			for (iterator iter = b; iter != e; iter++)
dvander@102
   404
			{
dvander@102
   405
				if ( (*iter).key == u )
dvander@102
   406
					return iter;
dvander@102
   407
			}
dvander@102
   408
			return end();
dvander@102
   409
		}
dvander@102
   410
		template <typename U>
dvander@102
   411
		iterator find(const U & u)
dvander@102
   412
		{
dvander@102
   413
			iterator b = begin();
dvander@102
   414
			iterator e = end();
dvander@102
   415
			for (iterator iter = b; iter != e; iter++)
dvander@102
   416
			{
dvander@102
   417
				if ( (*iter).key == u )
dvander@102
   418
					return iter;
dvander@102
   419
			}
dvander@102
   420
			return end();
dvander@102
   421
		}
dvander@102
   422
	private:
dvander@102
   423
		NodePtr	*m_Buckets;
dvander@102
   424
		size_t m_numBuckets;
dvander@102
   425
		float m_percentUsed;
dvander@102
   426
	};
dvander@102
   427
};
dvander@102
   428
dvander@102
   429
#endif //_INCLUDE_SH_TINYHASH_H_