HashTableBySTLVector< T > Class Template Reference

#include <TAPsHashTableBySTLVector.hpp>

List of all members.

Public Member Functions
std::vector< T > const &	GetBucketNo (int i) const
int	GetNoOfBuckets () const
	HashTableBySTLVector (int numberOfBuckets)
int	Insert (T in, int bucketNo)
int	InsertSort (T in, int bucketNo)
int	Search (T key, int bucketNo)
int	SearchSort (T key, int bucketNo)
	~HashTableBySTLVector ()
Private Attributes
int	m_iNoOfBuckets
std::vector< T > *	m_pvBucketNo
Friends
std::ostream &	operator<< (std::ostream &output, HashTableBySTLVector< T > const &o)

---

Detailed Description

template<typename T>
class HashTableBySTLVector< T >

Definition at line 20 of file TAPsHashTableBySTLVector.hpp.

---

Constructor & Destructor Documentation

template<typename T>

BEGIN_NAMESPACE_TAPs__DS HashTableBySTLVector< T >::HashTableBySTLVector

(

int

numberOfBuckets

)

[inline]

Definition at line 20 of file TAPsHashTableBySTLVector.cpp.

    : m_iNoOfBuckets( numberOfBuckets )
{   
    m_pvBucketNo = new std::vector<T>[m_iNoOfBuckets];
}

template<typename T>

HashTableBySTLVector< T >::~HashTableBySTLVector

(

)

[inline]

Definition at line 27 of file TAPsHashTableBySTLVector.cpp.

{   
    if ( m_pvBucketNo != NULL ) {
        delete [] m_pvBucketNo;
    }
    m_pvBucketNo = NULL;
}

---

Member Function Documentation

template<typename T>

std::vector<T> const& HashTableBySTLVector< T >::GetBucketNo

(

int

i

)

const [inline]

Definition at line 56 of file TAPsHashTableBySTLVector.hpp.

    { return m_pvBucketNo[i]; }

template<typename T>

int HashTableBySTLVector< T >::GetNoOfBuckets

(

)

const [inline]

Definition at line 55 of file TAPsHashTableBySTLVector.hpp.

{ return m_iNoOfBuckets; }

template<typename T>

int HashTableBySTLVector< T >::Insert	(	T	in,
		int	bucketNo
	)			[inline]

Definition at line 42 of file TAPsHashTableBySTLVector.cpp.

{
    m_pvBucketNo[ bucketNo ].push_back( in );
    return static_cast<int>( m_pvBucketNo[ bucketNo ].size() - 1 );
}

template<typename T>

int HashTableBySTLVector< T >::InsertSort	(	T	in,
		int	bucketNo
	)			[inline]

Definition at line 69 of file TAPsHashTableBySTLVector.cpp.

{
    if ( !m_pvBucketNo[ bucketNo ].empty() ) {
        std::vector<T>::iterator pos = m_pvBucketNo[ bucketNo ].begin();
        for ( int i = 0; i < static_cast<int>( m_pvBucketNo[ bucketNo ].size() ); ++i, ++pos ) {
            if ( in < m_pvBucketNo[ bucketNo ][ i ] ) {
                m_pvBucketNo[ bucketNo ].insert( pos, in );
                return i;
            }
        }
    }
    m_pvBucketNo[ bucketNo ].push_back( in );
    return static_cast<int>( m_pvBucketNo[ bucketNo ].size() - 1 );
}

template<typename T>

int HashTableBySTLVector< T >::Search	(	T	key,
		int	bucketNo
	)			[inline]

Definition at line 51 of file TAPsHashTableBySTLVector.cpp.

{
    if ( !m_pvBucketNo[ bucketNo ].empty() ) {
        for ( int i = 0; i < m_pvBucketNo[ bucketNo ].size(); ++i ) {
            if ( key == m_pvBucketNo[ bucketNo ][ i ] ) {
                return i;
            }
        }
    }
    return -1;  // empty bucket or not found
}

template<typename T>

int HashTableBySTLVector< T >::SearchSort	(	T	key,
		int	bucketNo
	)			[inline]

Definition at line 87 of file TAPsHashTableBySTLVector.cpp.

{
    if ( !m_pvBucketNo[ bucketNo ].empty() ) {
        for ( int i = 0; i < m_pvBucketNo[ bucketNo ].size(); ++i ) {
            if ( key >= m_pvBucketNo[ bucketNo ][ i ] ) {
                if ( key == m_pvBucketNo[ bucketNo ][ i ] ) return i;
                else                                        return -1;
            }
        }
    }
    return -1;  // empty bucket or not found
}

---

Friends And Related Function Documentation

template<typename T>

std::ostream& operator<<	(	std::ostream &	output,
		HashTableBySTLVector< T > const &	o
	)			[friend]

Definition at line 33 of file TAPsHashTableBySTLVector.hpp.

    {
        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;
    }

---

Member Data Documentation

template<typename T>

int HashTableBySTLVector< T >::m_iNoOfBuckets [private]

Definition at line 25 of file TAPsHashTableBySTLVector.hpp.

template<typename T>

std::vector<T>* HashTableBySTLVector< T >::m_pvBucketNo [private]

Definition at line 26 of file TAPsHashTableBySTLVector.hpp.

---

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

• G:/spunak_xp/Works/TAPs/Include/TAPs/DataStructure/TAPsHashTableBySTLVector.hpp
• G:/spunak_xp/Works/TAPs/Include/TAPs/DataStructure/TAPsHashTableBySTLVector.cpp