// Course: CS 141 // Lecture Section: Enter your lecture section number here (1, 2) // Lab Section: Enter your lab section number here (21, 22, 23) // Assignment #: 1 // First Name: Enter your FIRST name here (eg, John) // Last Name: Enter your LAST name here (eg, Doe) // ID Number: Enter your ID number here (eg, 12-345-678) // Email address: Enter your UCR email address here (eg, jdoe@cs.ucr.edu) // ======================================================================= #ifndef _HASH_CC #define _HASH_CC #include #include "Hash.h" #include "Array.cc" #include "AssocList.cc" // fill out your code here: // destructor template HashTable::~HashTable() { } // constructor without default value template HashTable::HashTable() { } // constructor with default value template HashTable::HashTable(VALUE const &def) { } // copy constructor template HashTable::HashTable(const HashTable& a) { } // operator= template // deep copy HashTable& HashTable::operator=(const HashTable& a) { } // clear template void HashTable::clear() { } // hash template int HashTable::hash(KEY const & k) const { } // grow template void HashTable::grow() { } // exists template int HashTable::exists(KEY const & k) const { } // remove template void HashTable::remove(KEY const & k) { } // operator[] and const operator[] template VALUE & HashTable::operator[](KEY const & k) { } template VALUE HashTable::operator[](KEY const & k) const { } // keys() and values() template Array HashTable::keys() const { } template Array HashTable::values() const { } // operator<< template std::ostream & operator<<(std::ostream & out, const HashTable & a) { } #endif