Question

Write the code to make a complete copy of a hash table (using chaining) of the last chain (that exists) into a new linear linked list. Assume you know the size of the hash table (size M). The data in each node is a dynamically allocated array of characters.
with c++

Answer 1

Const int DEFAULT_TABLE_SIZE=128;

Class HashMap {

Private:

float threshold;

Int maxSize;

Int tableSize;

Int Size;

LinkedHashEntry** table;

Void resize() {

int oldTableSize= tableSize;

tableSize *= 2;

max Size=(int) (tableSize*threshold) ;

LinkedHashEntry **oldTable= table;

table = new LinkedHashEntry * (tableSize);

for ( int I =0 ; i < tableSize; i++)

table (i)= NULL;

Size = 0;

for ( int hash =0;

hash < oldTableSize; hash++)

if (oldTable(hash)! = NULL) {

LinkedHashEntry * oldEntry;

LinkedHashEntry * entry =oldTable (hash) ;

while

(entry! =NULL) {

put ( entry-> getNext() ;

delete oldEntry;

}}

delete() oldTable;

}

PUBLIC:

HashMap() {

threshold =0.75 f;

maxmaxSize= 96;

tableSize=DEFAULT_TABLE_SIZE;

size=0;

table=new LinkedHashEntry*(tableSize) ;

For ( int i= 0; i<tableSize; I++)

table (I) =NUll;(

}

Void setThreshold(float threshold) {

this->threshold=threshold;

maxSize=(int) (tableSize* threshold) ;}

Int get (int key) {

Int hash=(key% tableSize) ;

If(table( hash) == NULL)

return -1;else{

LinkedHashEntry* entry = table [ hash];

While (entry! = NULL &&entry->getNext () ;

If( entry==NULL)

return -1;else return entry->get value () ;

}}

void put ( int key, int value) {

int hash=(key% tableSize) ;

If ( table (hash) == NULL) {

table (hash) = new LinkedHashEntry ( key, value) ;

size++;}else{

LinkedHashEntry* entry = table ( hash) ;

while ( entry-> getNext()! = NULL)

entry= entry->getNext() ;

if entry->getKey()==key) entry->setValue(value) ;

else{

entry->setNext(new LinkedHashEntry (key, value)) ;

size++;}}

if (size>=maxsize)

resize() ;}

void remove( int key) {

int hash = ( key% tableSize) ;

if (table(hash)! =NULL) }

LinkedHashEntry*prevEntry= NULL;

LinkedHashEntry * Entry= table (hash) ;

While ( entry->getNext()! =NULL &&entry->getKey()! =key) {

prevEntry =entry;

entry=entry-> getNext () ;}

if ( entry->getKey() ==key) {

If ( prevEntry == NULL) {

LinkedHashEntry* next Entry=entry-> get Next () ;

delete entry;

Table ( hash) = next Entry;}else{

LinkedHashEntry* next = entry->get Next () ;

delete entry;

prevEntry->setNext( next) ;}

size--;

}}}

HashMap ()

{for ( int hash=0;

hash < table Size; hash++)

if ( table ( hash! = NULL) {

LinkedHashEntry * prevEntry= NULL;

LinkedHashEntry * entry= table ( hash) ;

while ( entry! = NULL) {

PrevEntry= Entry;

entry= entry-> getNext() ;

Delete prevEntry;}}

delete [] table;}

};