Difference between revisions of "Intermediate C++ Game Programming Tutorial 24"
From Chilipedia
(→Video Timestamp Index) |
(→Video Timestamp Index) |
||
| Line 49: | Line 49: | ||
</div> | </div> | ||
* Requirements on KeyType [https://youtu.be/JlPsCoCO99o?t=14m30s 14:30] | * Requirements on KeyType [https://youtu.be/JlPsCoCO99o?t=14m30s 14:30] | ||
| + | <div class="mw-collapsible-content"> | ||
** The KeyType has to be comparable. The third template parameter is a functor for KeyType Comparison that defaults to <code>std::less<KeyType></code> | ** The KeyType has to be comparable. The third template parameter is a functor for KeyType Comparison that defaults to <code>std::less<KeyType></code> | ||
| + | ** So by default keys have to implement the "less than" comparison operator or provide your own comparison functor when defining the map | ||
| + | </div> | ||
</div> | </div> | ||
[https://youtu.be/LsjFAx-dG5I Tutorial 24.2] | [https://youtu.be/LsjFAx-dG5I Tutorial 24.2] | ||
Revision as of 03:36, 20 January 2020
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
[hide]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
Video Timestamp Index
[Expand]
- The
std::map<KeyType,ValueType>class 0:46
- The Binary tree data structure 2:46
- A look at the
std::mapcppreference.com documentation 7:35
- Requirements on KeyType 14:30
- [WORK-IN-PROGRESS]
Homework Assignment
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.
