← Back to Overview

High-Performance Hashtable

C++ Templates Data Structures Testing

Overview

A generic C++ hashtable implemented from scratch to study collision handling, dynamic resizing, and performance behavior.

The project uses separate chaining with linked lists rather than relying on the standard library implementation. It was designed to support different key and value types through templates.

Key Features

Challenges

The hardest parts were maintaining correctness during rehashing, managing templated code across multiple files, and preventing memory or iterator errors while modifying chained entries.

What I Learned

The project strengthened my understanding of hashing, amortized performance, collision resolution, templates, memory management, and systematic testing.