TAPsHashTableBySTLVector.hpp

Go to the documentation of this file.

/******************************************************************************
TAPsHashTableBySTLVector.hpp

Class TAPsHashTableBySTLVector is a hash table created from STL vector class.
All values, assume numbers, in bucket will be sorted.

SUKITTI PUNAK   (04/08/2005)
UPDATE          (04/15/2005)
******************************************************************************/
#ifndef TAPs_HASH_TABLE_BY_STL_VECTOR_HPP
#define TAPs_HASH_TABLE_BY_STL_VECTOR_HPP

#include "../Core/TAPsStdLib.hpp"
#include <vector>

BEGIN_NAMESPACE_TAPs__DS
//=============================================================================
template <typename T>
class HashTableBySTLVector {
//=============================================================================
// DATA MEMBERS
//=============================================================================
private:
    int m_iNoOfBuckets;             // number of buckets
    std::vector<T> *m_pvBucketNo;   // bucket number
//=============================================================================
// MEMBER FUNCTIONS
//=============================================================================
public:
    //-------------------------------------------------------------------------
    // Output Operator <<
    friend std::ostream & operator<< ( std::ostream &output, 
                                       HashTableBySTLVector<T> const &o )
    {
        output  << "HashTableBySTLVector<" << typeid(T).name() << "> has "
                << o.m_iNoOfBuckets << " bucket(s):\n";
        //------------------------------------------------------------
        // Output all bucket
        for ( int i = 0; i < o.m_iNoOfBuckets; ++i ) {
            output << "Bucket# " << i << ":";
            for ( int j = 0; j < static_cast<int>( o.m_pvBucketNo[i].size() ); ++j ) {
                output << " " << o.m_pvBucketNo[i][j];
            }
            output << "\n";
        }
        return output;
    }
    //-------------------------------------------------------------------------
    // Constructor(s) and Destructor
    HashTableBySTLVector ( int numberOfBuckets );
    ~HashTableBySTLVector ();
    //-------------------------------------------------------------------------
    // Get/Set Fns
    inline int GetNoOfBuckets () const { return m_iNoOfBuckets; }
    inline std::vector<T> const & GetBucketNo ( int i ) const
    { return m_pvBucketNo[i]; }
    //-------------------------------------------------------------------------
    // Operation(s) Unsorted Elements
    //-------------------------------------------------------------------------
    // Insert in into bucket#
    // All values, assume numbers, in bucket will not be sorted.
    // Return the inserted index
    int Insert ( T in,  int bucketNo );
    // Search key in bucket# with unsorted values
    // Return the first index that contains the key, else return -1
    int  Search ( T key, int bucketNo );
    //void Remove ( T key );
    //-------------------------------------------------------------------------
    // Operation(s) Sorted Elements
    //-------------------------------------------------------------------------
    // Insert in into bucket#
    // All values, assume numbers, in bucket will be sorted.
    // Return the inserted index
    int InsertSort ( T in,  int bucketNo );
    // Search key in bucket# with sorted values
    // Return the first index that contains the key, else return -1
    int  SearchSort ( T key, int bucketNo );    
    //void RemoveSort ( T key );
    //-------------------------------------------------------------------------
}; // END CLASS HashTableBySTLVector
//=============================================================================
END_NAMESPACE_TAPs__DS
//-----------------------------------------------------------------------------
// Include definition if TAPs_USE_EXPORT is not defined
//#if !defined( TAPs_USE_EXPORT )
    #include "TAPsHashTableBySTLVector.cpp"
//#endif
//-----------------------------------------------------------------------------
#endif
//345678901234567890123456789012345678901234567890123456789012345678901234567890
//--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8