Difference between revisions of "Intermediate C++ Game Programming Tutorial 24"
From Chilipedia
(→Video Timestamp Index) |
(→Topics Covered) |
||
| Line 5: | Line 5: | ||
* Binary tree data structure | * Binary tree data structure | ||
* <code>std::map</code> key requirements (comparison) | * <code>std::map</code> key requirements (comparison) | ||
| − | * <code>std::map</code> gotchas (<code>std::remove_if</code> and const keys) | + | * <code>std::map</code> gotchas (<code>std::remove_if</code> and <code>const</code> keys) |
* <code>std::set</code> | * <code>std::set</code> | ||
* <code>std::multimap</code> and <code>std::multiset</code> | * <code>std::multimap</code> and <code>std::multiset</code> | ||
Revision as of 13:26, 27 February 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.
Topics Covered
-
std::mapcontainer interface - Binary tree data structure
-
std::mapkey requirements (comparison) -
std::mapgotchas (std::remove_ifandconstkeys) -
std::set -
std::multimapandstd::multiset
