C++ 哈希表使用链接、删除方法

我正在使用链接在C++中实现哈希表。代码生成时没有错误，并且使用插入方法可以很好地构建表。但是，当我调用 remove 方法时，我收到以下错误：

在 HashTable .exe 中0x00c53be9处出现未经处理的异常： 0xC0000005：访问冲突读取位置0x00000000。

哈希输入代码：

#include <string>
#include <vector>
template <class T>
class HashEntry
{
private:
    int key; //lookup key
    T value; //hash data
    HashEntry<T> *next;
public:
    HashEntry(int key, T value);
    HashEntry();
    int& getKey();
    T& getValue();
    void setValue(T value);
    HashEntry<T>* getNext();
    void setNext(HashEntry *next);
    bool operator == (HashEntry& rhs);
    bool operator != (HashEntry& rhs);
    HashEntry<T>& operator = (HashEntry& rhs);
};
template <class T> 
HashEntry<T>::HashEntry(int key, T value)
{
    this->key = key;
    this->value = value;
    this->next= nullptr;
}
template <class T>
HashEntry<T>::HashEntry()
{
    this->key = 0;
    this->next= nullptr;
}
template <class T>
int& HashEntry<T>::getKey()
{
    return key;
}
template <class T>
T& HashEntry<T>::getValue()
{
    return value;
}
template <class T>
void HashEntry<T>::setValue(T value)
{
    this->value = value;
}
template <class T>
HashEntry<T>* HashEntry<T>::getNext()
{
    return next;
}
template <class T>
void HashEntry<T>::setNext (HashEntry *next)
{
    this->next = next;
}
template <class T>
bool HashEntry<T>::operator == (HashEntry& rhs)
{
    return ((this->getKey() == rhs.getKey()) && (this->getValue() == rhs.getValue()));
}
template <class T>
bool HashEntry<T>::operator != (HashEntry& rhs)
{
    return ((this->getKey() != rhs.getKey()) && (this->getValue() != rhs.getValue()));
}
template <class T>
HashEntry<T>& HashEntry<T>::operator = (HashEntry& rhs)
{
    this->key = rhs.getKey();
    this->value = rhs.getValue();
    this->next = rhs.getNext();
    return *this;
}

哈希表代码：

template <class T>
class HashTable
{
private:
    std::vector<HashEntry<T>> table;
    static const int DEFAULT_TABLE_SIZE = 128;
    int TABLE_SIZE;

public:
    HashTable();
    void insert(int key, T value);
    void remove(int key);
    void get(int key);
    ~HashTable();
};
template <class T>
HashTable<T>::HashTable()
{
    TABLE_SIZE = DEFAULT_TABLE_SIZE;
    table.resize(TABLE_SIZE);
}

删除方法代码：

template <class T>
void HashTable<T>::remove(int key)
{
    int hashFunc = (key % TABLE_SIZE);
    if (table[hashFunc] != HashEntry<T>())
    {
        HashEntry<T> prevEntry = HashEntry<T>();
        HashEntry<T> entry = table[hashFunc];
        while (entry.getNext() != nullptr && entry.getKey() != key)
        {
            prevEntry = entry;
            entry = *entry.getNext();
        }
        if (entry.getKey() == key)
        {
            if (prevEntry == HashEntry<T>())
            {
                HashEntry<T> nextEntry = *entry.getNext(); //Where the exception is thrown
                entry = HashEntry<T>();
                table[hashFunc] = nextEntry;
            }
            else
            {
                HashEntry<T> *next = entry.getNext();
                entry = HashEntry<T>();
                prevEntry.setNext(next);
            }
        }
    }
}