Difference between revisions of "Intermediate C++ Game Programming Tutorial 24"

From Chilipedia
Jump to: navigation, search
(Video Timestamp Index)
(Video Timestamp Index)
Line 20: Line 20:
 
[https://youtu.be/JlPsCoCO99o Tutorial 24.1]
 
[https://youtu.be/JlPsCoCO99o Tutorial 24.1]
 
* The <code>std::map</code> class [https://youtu.be/JlPsCoCO99o?t=0m46s 0:46]
 
* The <code>std::map</code> class [https://youtu.be/JlPsCoCO99o?t=0m46s 0:46]
 +
** keys to lookup (associated with) values
 +
** <code>insert</code> to insert (key,value) pairs
 +
  
 
[https://youtu.be/LsjFAx-dG5I Tutorial 24.2]
 
[https://youtu.be/LsjFAx-dG5I Tutorial 24.2]

Revision as of 00:20, 8 December 2019

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

Part 1

  • std::map container interface
  • Binary tree data structure
  • std::map key requirements (comparison)
  • std::map gotchas (std::remove_if and const keys)
  • std::set
  • std::multimap and std::multiset

Part 2

  • Hash table performance vs. binary tree performance
  • Hash table data structure
  • std::unordered_map key requirements
  • Hash combining
  • std::unordered_map bucket interface and hashing policy
  • When to choose std::map over std::unordered_map

Video Timestamp Index

Tutorial 24.1

  • The std::map class 0:46
    • keys to lookup (associated with) values
    • insert to insert (key,value) pairs


Tutorial 24.2

  • [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.

Supplementary Link

See also