Project aims to build a drop-in replacement for std::unordered_map, being an open-addressed hash map built for use in Optiver, where each node contains a key and a pointer to a value, as described in a CppCon 2017 talk by Carl Cook.
Here's the Medium post elaborating more on the motivation and reasoning behind building such a hash map and how it would be more cache-efficient compared to a hash map implemented with chaining.
- C++ 20
- CMake v3.23
chmod u+x build.sh && ./build.sh# remove existing build, make build directory and cd inside
rm -rf build && mkdir build && cd build
# init cmake from CMakeLists in project root
cmake -DCMAKEBUILD_TYPE=Relase ..
# build
cmake --build .- Initial implementation with key features, find, insert, clear
- Expand the map when it reaches its load factor
- Benchmark it compared to std::unordered_map
- [] Profile for memory leaks
- [] Implementing erase and emplace
- [] Write concepts for Probe and static_assert in map impl
- [] Make containers allocator-aware
- [] Optimizations for rvalue references
| Methods | Impl? |
|---|---|
| empty | Y |
| size | Y |
| max_size | Y |
| clear | Y |
| find | Y |
| insert | Y |
| emplace | N |
| erase | N |
| swap | N |
| at | Y |
| operator[] | Y |
| count | Y |
| find | Y |
| contains | Y |
| load_factor | Y |
| max_load_factor | Y |
| rehash | N |
| reserve | N |
| hash_function | Y |
| key_eq | Y |