Difference between revisions of "Intermediate C++ Game Programming Tutorial 24"
From Chilipedia
(→Part 2) |
(→Part 2) |
||
| Line 10: | Line 10: | ||
* <code>std::multimap</code> and <code>std::multiset</code> | * <code>std::multimap</code> and <code>std::multiset</code> | ||
=== Part 2 === | === Part 2 === | ||
| + | * Hash table performance vs. binary tree performance | ||
* Hash table data structure | * Hash table data structure | ||
* <code>std::unordered_map</code> key requirements | * <code>std::unordered_map</code> key requirements | ||
Revision as of 20:32, 10 March 2018
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.
Contents
Topics Covered
Part 1
-
std::mapcontainer interface - Binary tree data structure
-
std::mapkey requirements (comparison) -
std::mapgotchas (std::remove_ifandconstkeys) -
std::set -
std::multimapandstd::multiset
Part 2
- Hash table performance vs. binary tree performance
- Hash table data structure
-
std::unordered_mapkey requirements - Hash combining
-
std::unordered_mapbucket interface and hashing policy - When to choose
std::mapoverstd::unordered_map
