Intermediate C++ Game Programming Tutorial 24
Associative containers are super useful, both as a convenient fast way to create dictionary or mapping for real-world problems like managing game resources, and as a data structure to help solve more abstract algorithmic computer science problems. And hash tables are fast as balls.
- Binary tree data structure
std::mapkey requirements (comparison)
- Hash table performance vs. binary tree performance
- Hash table data structure
- Hash combining
std::unordered_mapbucket interface and hashing policy
- When to choose
Video Timestamp Index
The homework for this video is to enable use of a custom datatype in
unordered_map hashing over multiple (4) members of that datatype. The solution video is here.