debbynirwan

    start = clock();
    for (int i = 0; i < j; i++) {
        uTable.insert({ i, i * 5 });
    }
    end = clock();
    cpu_time_used = end - start;

debbynirwan

#include <time.h>

void test()
{
    clock_t start, end;
    double cpu_time_used;
    
    start = clock();
    // insert your code here
    end = clock();

debbynirwan

template <class Key, class Value>
void HashTable<Key, Value>::Reserve(const std::size_t n)
{
    std::size_t size = (n <= 0) ? 1 : n;
    Rehash(size);
}

debbynirwan

template <class Key, class Value>
void HashTable<Key, Value>::Remove(const Key& key)
{
    if (m_size == 0)
        return;

    std::size_t hash_code = m_hashFunc(key);
    std::size_t index = HashCodeToIndex(hash_code, BucketCount());
    Node* node = m_table[index];
    Node* prev_node = nullptr;

debbynirwan

template <class Key, class Value>
Value HashTable<Key, Value>::At(const Key& key)
{
    if (m_size == 0)
        throw std::out_of_range("table is empty");

    std::size_t hash_code = m_hashFunc(key);
    std::size_t index = HashCodeToIndex(hash_code, BucketCount());
    Node* node = m_table[index];

debbynirwan

template <class Key, class Value>
void HashTable<Key, Value>::Insert(const Key& key, const Value& value)
{
    Node* node = PrepareInsertion(key);

    if (node != nullptr) {
        node->value = value;
        return;
    }

debbynirwan

template <class Key, class Value>
void HashTable<Key, Value>::Rehash(const std::size_t n)
{
    std::vector<Node*> newTable(n);
    for (int i = 0; i < n; i++)
        newTable[i] = nullptr;

    if (m_table.size() != 0) {
        for (int i = 0; i < BucketCount(); i++) {
            Node* current_node = m_table[i];

debbynirwan

template <class Key, class Value>
typename HashTable<Key, Value>::Node* HashTable<Key, Value>::PrepareInsertion(const Key& key)
{
    if (m_size != 0) {
        std::size_t hash_code = m_hashFunc(key);
        std::size_t index = HashCodeToIndex(hash_code, BucketCount());
        Node* node = m_table[index];

        while (node != nullptr) {
            if (node->key == key)

debbynirwan

std::vector<Node*> m_table;

debbynirwan

template <class Key, class Value>
struct Node {
    Key key;
    Value value;
    std::size_t hash_code;
    Node* next;
};