HashPool< T > Class Template Reference

#include <CompressPsf.h>

Public Member Functions
	~HashPool ()
void	clear ()
int	lookupCstPool (const T &val)
void	push_back (const T &x)
void	dump_tables ()
T &	operator[] (int i) const
int	size ()

Detailed Description

template<typename T>
class HashPool< T >

Definition at line 103 of file CompressPsf.h.

Constructor & Destructor Documentation

~HashPool()

template<typename T>

HashPool< T >::~HashPool ( )

inline

Definition at line 105 of file CompressPsf.h.

References HashPool< T >::clear().

              {
    clear();
  }

Member Function Documentation

clear()

template<typename T>

void HashPool< T >::clear ( )

inline

Definition at line 109 of file CompressPsf.h.

Referenced by HashPool< T >::~HashPool().

               {
    // Delete the pool entries
    for ( int i=0; i < pool.size(); i++)
      delete pool[i];
    // Clear the pool and hash table
    pool.clear();
    index_table.empty();
  }

dump_tables()

template<class T >

void HashPool< T >::dump_tables

(

)

Definition at line 1386 of file CompressPsf.C.

References HashPoolAdaptorT< T >::hash().

Referenced by HashPool< T >::lookupCstPool().

{
  for(int j=0; j < pool.size(); j++) {
    HashPoolAdaptorT<T>* pval = pool[j];
    CmiPrintf("Pool[%d]=%p %p  hash = %d\n",j,pool[j],pval,pval->hash());
  }
  CkHashtableIterator *iter = index_table.iterator();
  void *key,*indx;
  while (iter->hasNext()) {
    indx = iter->next(&key);
    HashPoolAdaptorT<T> *pkey = (HashPoolAdaptorT<T>*)key;
    CmiPrintf("key %p indx %p %d hash=%d\n",key,indx,*((int *)indx),pkey->hash());
  }
}

lookupCstPool()

template<typename T>

int HashPool< T >::lookupCstPool ( const T &  val )

inline

Definition at line 118 of file CompressPsf.h.

References HashPool< T >::dump_tables(), and HashPoolAdaptorT< T >::hash().

  {
    HashPoolAdaptorT<T> hx(val);
    // Ugly: Can't store zeros in the table, so add 1 to indices on insert and
    // subtract 1 to get real index when retrieving
    int loc = index_table.get(hx) - 1;
#if 0
    int i;
    for(i=0; i < pool.size(); i++)
    {
      if (pool[i]->getVal() == val)  {
        if (i != loc) {
          CmiPrintf("Get[%d] returned %d, actual is %d\n",hx.hash(),loc,i);
          dump_tables();
          loc = i;
        }
        break;
      }
    }
    if (loc != -1 && i == pool.size()) {
      CmiPrintf("Get returned %d, actual not found\n",loc);
    }
#endif
    return loc;
  }

operator[]()

template<typename T>

T& HashPool< T >::operator[] ( int  i ) const

inline

Definition at line 163 of file CompressPsf.h.

{ return pool[i]->getVal(); }

push_back()

template<typename T>

void HashPool< T >::push_back ( const T &  x )

inline

Definition at line 144 of file CompressPsf.h.

  {
    // Behave like a STL vector, but also store the indexing info in
    // the hashtable index
    
    // Add to vector
    HashPoolAdaptorT<T>* val = new HashPoolAdaptorT<T>(x);
    pool.push_back(val);
    // Also add to hash table. Make sure pointer doesn't change
    int* index = &(index_table.put(*val));
    // Ugly: Can't store zeros in the table, so add one to all entries
    *index = pool.size(); // pool.size()  - 1 + 1
    
    //  CmiPrintf("Adding hx=%p hash=%d index[%p]=%d\n",&val,val->hash(),index,*index);
    //  dump_tables();  
  }

size()

template<typename T>

int HashPool< T >::size ( )

inline

Definition at line 165 of file CompressPsf.h.

{ return pool.size(); }

---

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

• CompressPsf.h
• CompressPsf.C