KKB::HashTable< Entry > Class Template Reference

#include <HashTable.h>

Public Types
typedef Entry *	EntryPtr

Public Member Functions
	HashTable (bool _owner, kkuint32 _tableSize, kkuint32 _keyLen)
	Hash Table management template; developed to support BitReduction algorithm. More...
	~HashTable ()
void	AddEntry (EntryPtr entry)
bool	DeleteEntry (EntryPtr _entry)
kkuint32	HashValue (const KKStr &str)
EntryPtr	LocateEntry (const KKStr &str)
kkuint32	NumOfEntries ()
void	Save (const KKStr &fileName)
HashEntryPtr *	Table ()
kkuint32	TableSize ()

Detailed Description

template<class Entry>
class KKB::HashTable< Entry >

Definition at line 19 of file HashTable.h.

Member Typedef Documentation

template<class Entry >

typedef Entry* KKB::HashTable< Entry >::EntryPtr

Definition at line 22 of file HashTable.h.

Constructor & Destructor Documentation

template<class Entry >

KKB::HashTable< Entry >::HashTable	(	bool	_owner,
		kkuint32	_tableSize,
		kkuint32	_keyLen
	)

Hash Table management template; developed to support BitReduction algorithm.

This template was originally written by Tong Luo to support his experiments in Bit reduction. It was later heavily modified by Kurt Kramer to conform to the PicesLibrary structure.

Definition at line 85 of file HashTable.h.

                               :
      owner        (_owner),
      numOfEntries (0),
      tableSize    (_tableSize),
      keyLen       (_keyLen)
  {
    table = new HashEntryPtr[tableSize];
    kkuint32  x;
    for  (x = 0; x < tableSize; x++)
      table[x] = NULL;

    hashFactors = new kkint32[keyLen];

    kkint32  fact = 53;
    kkint32  hashVal = 1;

    kkint32  maxHashVal = _tableSize * 10; 

    for  (x = 0; x < keyLen; x++)
    {
      if  (hashVal > maxHashVal)
        hashVal = 1;

      hashFactors[x] = hashVal;
      hashVal = hashVal * fact;
    }
  };

template<class Entry >

KKB::HashTable< Entry >::~HashTable

(

)

Definition at line 118 of file HashTable.h.

  {
    HashEntryPtr  cur;
    kkuint32      idx;
    HashEntryPtr  next;

    for  (idx = 0; idx < tableSize; idx++)
    {
      next = table[idx];
      while  (next)
      {
        cur = next;
        next = next->next;
        if  (owner)
        {
          delete  cur->entry;
        }
        delete cur;
      }
    }

    delete  table;
    delete  hashFactors;
  }

Member Function Documentation

template<class Entry >

void KKB::HashTable< Entry >::AddEntry

(

EntryPtr

entry

)

Definition at line 173 of file HashTable.h.

  {
    kkuint32  hashValue = HashValue (entry->Key ());

    HashEntryPtr  next = table[hashValue];

    if  (next)
    {
      //cout << "Duplicate Hash " << hashValue << endl;
    }

    table[hashValue] = new HashEntry (entry, next);

    numOfEntries++;
  }  /* AddEntry */

template<class Entry >

bool KKB::HashTable< Entry >::DeleteEntry

(

EntryPtr

_entry

)

Definition at line 191 of file HashTable.h.

  {
    kkuint32  hashValue = HashValue (entry->Key ());

    HashEntryPtr next = table[hashValue];
    HashEntryPtr last = NULL;

    bool  deleted = false;

    while  (next)
    {
      if  (next == entry)
      {
        if  (last)
        {
          last->next = next->next;
        }
        else
        {
          table[hashValue] = next->next;
        }

        delete  next;
        next = NULL;
        numOfEntries--;
        deleted = true;
      }
      else
      {
        last = next;
        next = next->next;
      }
    }

    return  deleted;
  }  /* DeleteEntry */

template<class Entry >

kkuint32 KKB::HashTable< Entry >::HashValue

(

const KKStr &

str

)

Definition at line 230 of file HashTable.h.

  {
    const char*  s = str.Str ();
    kkint32  len = strlen (s);
    kkint32 x = len;
    kkuint32  y = 0;
    long  hashVal = 0;

    while  ((x > 0)  &&  (y < keyLen))
    {
      x--;
      hashVal = hashVal + s[x] * hashFactors[y];
      y++;
    }

    hashVal = hashVal % tableSize;
    return  hashVal;
  }  /* HashValue */

template<class Entry >

HashTable< Entry >::EntryPtr KKB::HashTable< Entry >::LocateEntry

(

const KKStr &

str

)

Definition at line 145 of file HashTable.h.

  {
    kkuint32  hashValue = HashValue (key);

    // kkuint32  idx =  CalcIndex (hashValue);
    kkuint32  idx =  hashValue;

    EntryPtr entry     = NULL;

    HashEntryPtr next = table[idx];

    while  ((!entry)  &&  next)
    {
      if  (next->entry->Key () == key)
      {
        entry = next->entry;
      }
      else
      {
        next = next->next;
      }
    }
    
    return  entry;
  }  /* LocateEntry */

template<class Entry >

kkuint32 KKB::HashTable< Entry >::NumOfEntries ( )

inline

Definition at line 70 of file HashTable.h.

{return  numOfEntries;}

template<class Entry >

void KKB::HashTable< Entry >::Save

(

const KKStr &

fileName

)

Definition at line 251 of file HashTable.h.

  {
    ofstream f (fileName.Str ());

    if  (!f)
    {
      cerr << endl;
      cerr << "*** ERROR ***,  Error Opening File[" << fileName << "]." << endl;
      cerr << endl;
      return;
    }

    HashEntryPtr  next = NULL;
    kkuint32  idx = 0;

    while  (idx < TableSize ())
    {
      next = (Table ())[idx];

      while  (next)
      {
        f << next->entry->ToString () << endl;
        next = next->next;
      }

      idx++;    
    }

    f.close ();
  }  /* Save */

template<class Entry >

HashEntryPtr* KKB::HashTable< Entry >::Table ( )

inline

Definition at line 72 of file HashTable.h.

{return  table;}

template<class Entry >

kkuint32 KKB::HashTable< Entry >::TableSize ( )

inline

Definition at line 74 of file HashTable.h.

{return  tableSize;}

---

The documentation for this class was generated from the following file:

• C:/Users/Kurt/GitHub/KSquareLibraries/KKBase/HashTable.h