Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

-------------------HashedEntry.h---------------------------------------------- -

ID: 3576064 • Letter: #

Question

-------------------HashedEntry.h----------------------------------------------

------------------------------HashedDictionary.h--------------------------------

--------------------------------Entry.h------------------------------------

Explanation / Answer

#define _HASHEDDICTIONARY_H_ #define _HASHEDDICTIONARY_H_ #include #include #include "bucket.h" template class HashedDictionary { private: Bucket* mBuckets; int mCount; int hash(string key) { int value = 0; for (int i = 0; i mCount = 101; mBuckets = new Bucket[mCount]; } template HashedDictionary::HashedDictionary(int mCount) { // Default mCount to 16 if invalid this->mCount = (mCount >= 0 ? mCount : 16); // Define mBins mBuckets = new Bucket[mCount]; } template HashedDictionary::~HashedDictionary() { delete[] mBuckets; } template bool HashedDictionary::containsKey(string key) { int bin = hash(key); return mBuckets[bin].isExist(key); } template void HashedDictionary::display() { cout