You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
48 lines
1.7 KiB
C++
48 lines
1.7 KiB
C++
SeparateChaining.h - Header file for separate chaining
|
|
|
|
#ifndef SEPARATE_CHAINING_H_
|
|
#define SEPARATE_CHAINING_H_
|
|
|
|
#include "vector.h"
|
|
#include "mystring.h"
|
|
#include "LinkedList.h"
|
|
|
|
// SeparateChaining Hash table class
|
|
//
|
|
// CONSTRUCTION: an initialization for ITEM_NOT_FOUND
|
|
// and an approximate initial size or default of 101
|
|
//
|
|
// ******************PUBLIC OPERATIONS*********************
|
|
// void insert( x ) --> Insert x
|
|
// void remove( x ) --> Remove x
|
|
// Hashable find( x ) --> Return item that matches x
|
|
// void makeEmpty( ) --> Remove all items
|
|
// int hash( string str, int tableSize )
|
|
// --> Global method to hash strings
|
|
|
|
template <class HashedObj>
|
|
class HashTable
|
|
{
|
|
public:
|
|
explicit HashTable( const HashedObj & notFound, int size = 101 );
|
|
HashTable( const HashTable & rhs )
|
|
: ITEM_NOT_FOUND( rhs.ITEM_NOT_FOUND ), theLists( rhs.theLists ) { }
|
|
|
|
const HashedObj & find( const HashedObj & x ) const;
|
|
|
|
void makeEmpty( );
|
|
void insert( const HashedObj & x );
|
|
void remove( const HashedObj & x );
|
|
|
|
const HashTable & operator=( const HashTable & rhs );
|
|
private:
|
|
vector<List<HashedObj> > theLists; // The array of Lists
|
|
const HashedObj ITEM_NOT_FOUND;
|
|
};
|
|
|
|
int hash( const string & key, int tableSize );
|
|
int hash( int key, int tableSize );
|
|
|
|
#include "SeparateChaining.cpp"
|
|
#endif
|