Skip to content

Update HashTable2.hpp #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
paintcrafter wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update HashTable2.hpp #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 15 additions & 16 deletions include/HashTable2.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,27 +7,26 @@

using namespace std;

template <typename KeyType, typename ValueType>
class CuckooHashTable {
private:
static const int MAX_LOOP = 50;

struct Entry {
KeyType key;
ValueType value;
int key;
string value;
bool occupied;

Entry() : occupied(false) {}
Entry(KeyType k, ValueType v, bool occ) : key(k), value(v), occupied(occ) {}
Entry(int k, string v, bool occ) : key(k), value(v), occupied(occ) {}
};

vector<vector<Entry>> tables;
size_t table_size;
hash<KeyType> hash1;
hash<KeyType> hash2;
hash<int> hash1;
hash<int> hash2;

void rehash() {
vector<pair<KeyType, ValueType>> old_elements;
vector<pair<int, string>> old_elements;
for (const auto& table : tables) {
for (const auto& entry : table) {
if (entry.occupied) {
Expand All @@ -42,17 +41,17 @@ class CuckooHashTable {
}
}

size_t hash_function1(const KeyType& key) const {
size_t hash_function1(const int& key) const {
return hash1(key) % table_size;
}

size_t hash_function2(const KeyType& key) const {
size_t hash_function2(const int& key) const {
return hash2(key) % table_size;
}

void swap(Entry& a, KeyType& key, ValueType& value) {
KeyType temp_key = a.key;
ValueType temp_value = a.value;
void swap(Entry& a, int& key, string& value) {
int temp_key = a.key;
string temp_value = a.value;

a.key = key;
a.value = value;
Expand All @@ -69,9 +68,9 @@ class CuckooHashTable {

~CuckooHashTable() {}

void insert(const KeyType& key, const ValueType& value) {
KeyType current_key = key;
ValueType current_value = value;
void insert(const int& key, const string& value) {
int current_key = key;
string current_value = value;
int count = 0;

while (count < MAX_LOOP) {
Expand All @@ -98,7 +97,7 @@ class CuckooHashTable {
insert(current_key, current_value);
}

void remove(const KeyType& key) {
void remove(const int& key) {
size_t pos1 = hash_function1(key);
if (tables[0][pos1].occupied && tables[0][pos1].key == key) {
tables[0][pos1].occupied = false;
Expand Down