🧠 Develop Plan - Open Addresing Hash Table

A C++ implementation of a hash table using open addressing with linear probing.
The goal of the project is to explore and implement the internal mechanisms of hash tables — from iterators and probing strategies to rehashing and efficiency analysis.

✅ Done

• ✅ Minimal Hash Table functions (insert, delete, find)
• ✅ operator[] and at()
• ✅ Move semantics
• ✅ Iterator
• ✅ Minimal Hash function
• ✅ Utility methods
• ✅ Lazy rehash
• ✅ Quadratic and double hashing
• ✅ Template extensions
• ✅ Unit tests
• ✅ Collision statistics

🚧 In Progress / Planned

• ✅ All done

💡 Maybe Later (Experimental Ideas)

• ⬜ Thread-safe operations using std::shared_mutex and std::lock_guard
• ⬜ Robin Hood hashing — equalizing probe distances

🧩 Notes

• Language: C++20
• Build system: CMake
• Structure: Header-only library
• Current branch: develop
• Goal: Complete STL-like hash table API with open addressing