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

From Chilipedia
Jump to: navigation, search
(Topics Covered)
(Part 2)
Line 14: Line 14:
 
* Hash combining
 
* Hash combining
 
* <code>std::unordered_map</code> bucket interface and hashing policy
 
* <code>std::unordered_map</code> bucket interface and hashing policy
 +
* When to choose <code>std::map</code> over <code>std::unordered_map</code>
  
 
== Video Timestamp Index ==
 
== Video Timestamp Index ==

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.

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 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

Supplementary Link

See also