Implements a hash table (or map) for efficient key-value storage and retrieval. More...

#include <HashTable.hpp>

Public Member Functions
	HashTable (size_t initCapacity=DEFAULT_CAPACITY, float loadFactor=DEFAULT_LOAD_FACTOR)
	~HashTable ()
void	clear ()
	Drops every entry and reallocates the table at its current capacity.
bool	contains (const Key &key) const
	True if key currently has a live entry.
bool	get (const Key &key, Value &outValue) const
	Looks up key and writes its value into outValue; returns false if not found.
size_t	getCapacity () const
size_t	getSize () const
void	insert (const Key &key, const Value &value)
	Inserts or updates the value for key, resizing first if over the load factor.
bool	remove (const Key &key)
	Tombstones the entry for key; returns false if it wasn't present.

Detailed Description

template<typename Key, typename Value>
class Sleak::HashTable< Key, Value >

Implements a hash table (or map) for efficient key-value storage and retrieval.

The HashTable class provides fast access to values based on their associated keys. It is suitable for scenarios where you need to quickly look up data using unique identifiers. Use this class when you need to store and retrieve data based on keys, such as symbol tables, dictionaries, or caching systems.

Example Use Cases:

Implementing a symbol table in a compiler.
Creating a dictionary or vocabulary lookup system.
Caching frequently accessed data.
Storing user preferences or configuration settings.

Implementation Details:

Uses a hash function to map keys to indices in an internal array.
Handles collisions using chaining or open addressing (specify which one you used).
Provides methods for inserting, deleting, and retrieving key-value pairs.

Definition at line 31 of file HashTable.hpp.